Bayesian networks are widely used graphical models which represent uncertain relations between the random variables in a domain compactly and intuitively. The first step of applying Bayesian networks to real-word problems typically requires building the network structure. Among others, optimal structure learning via score-and-search has become an active research topic in recent years. In this c...

With the vertiginous volume information growing, the amount of answers provided by traditional search engines and satisfying syntactically the user queries has enlarged directly. In order to reduce this problem the race to develop Semantic Search Engines (SSE) is increasingly popular. Currently, there are multiple proposals for Semantic Search Engines, and they are using a wide range of methods...

And-or graphs and theorem-proving graphs determine the same kind of search space and differ only in the direction of search: from axioms to goals, in the case of theorem-proving graphs, and in the opposite direction, from goals to axioms, in the case of and-or graphs. Bi-directional search strategies combine both directions of search. We investigate the construction of a single general algorith...

Search-based approaches to software design are investigated. Software design is considered from a wide view, including topics that can also be categorized under software maintenance or re-engineering. Search-based approaches have been used in research from high architecture level design to software clustering and finally software refactoring. Enhancing and predicting software quality with searc...

We extend the refined operational semantics of the Constraint Handling Rules language to support the implementation of different search strategies. Such search strategies are necessary to build efficient Constraint Logic Programming systems. This semantics is then further refined so that it is more suitable as a basis for a trailing based implementation. We propose a source to source transforma...

We correct an error in Lemma 4.2 of [Kanzow and Nagel, Semidefinite programs: New search directions, smoothing-type methods, and numerical results, SIAM J. Optim 13, 2003, pp. 1–23]. With this correction, all results in that paper remain true.

This article gives an overview of the problems of information retrieval systems that search court decisions. Several solutions and new research directions are suggested. The solutions are inspired by the technologies of current case-based reasoning systems.

Greedy best-first search (GBFS) is a popular and effective algorithm in satisficing planning and is incorporated into high-performance planners. GBFS in planning decides its search direction with automatically generated heuristic functions. However, if the heuristic functions evaluate nodes inaccurately, GBFS may be misled into a valueless search direction, thus resulting in performance degrada...

Metaplasticity (plasticity of synaptic plasticity) is defined as a change in the direction or degree plasticity response to preceding neuronal activity. Recent advances brain stimulation methods have enabled us non-invasively examine cortical metaplasticity, including research clinical setting. According current knowledge, non-invasive neuromodulation affects by inducing processes that are simi...

On April 21—23, 2021, the Russian State Library (RSL) hosted International scientific and practical conference “Rumyantsev Readings”, which is one of largest annual library events. The traditionally raises issues preserving studying world cultural heritage, promotes intercultural interaction. In it covered a wide range theory practice science, bibliography bibliology. participants are specialis...