Sciweavers

3047 search results - page 552 / 610
» On the Meaning of Logical Completeness
Sort
View
AMAI
2004
Springer
15 years 3 months ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
AMAI
2004
Springer
15 years 3 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
ISER
2004
Springer
143views Robotics» more  ISER 2004»
15 years 3 months ago
Imitation Learning Based on Visuo-Somatic Mapping
Abstract. Imitation learning is a powerful approach to humanoid behavior generation, however, the most existing methods assume the availability of the information on the internal s...
Minoru Asada, Masaki Ogino, Shigeo Matsuyama, Jun'...
JIT
2004
Springer
204views Database» more  JIT 2004»
15 years 3 months ago
Ercatons: Thing-Oriented Programming
Thing-oriented programming (TP) is an emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-orient...
Oliver Imbusch, Falk Langhammer, Guido von Walter