Sciweavers

8413 search results - page 213 / 1683
» Ordering Problem Subgoals
Sort
View
CPAIOR
2006
Springer
15 years 4 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 4 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
128
Voted
COLT
1995
Springer
15 years 4 months ago
A Comparison of New and Old Algorithms for a Mixture Estimation Problem
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
David P. Helmbold, Yoram Singer, Robert E. Schapir...
113
Voted
EPIA
1995
Springer
15 years 4 months ago
The Retrieval Problem in a Concept Language with Number Restrictions
In this paper, we study the retrieval problem in ALN, which is a tractable concept language with number restrictions. Following the approach proposed in [12], this work differs fr...
Aida Vitória, Margarida Mamede, Luís...
ICIA
2007
15 years 3 months ago
A Decision-Theoretic Model of Assistance - Evaluation, Extensions and Open Problems
There is a growing interest in intelligent assistants for a variety of applications from organizing tasks for knowledge workers to helping people with dementia. In our earlier wor...
Sriraam Natarajan, Kshitij Judah, Prasad Tadepalli...