3318 search results - page 399 / 664 » The Weak Instance Model |
138
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
132
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a rou...
120
click to vote
SAS
2001
Springer
15 years 9 months ago
2001
Springer
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attra...
113
click to vote
DOLAP
1999
ACM
15 years 8 months ago
1999
ACM
OLAP systems support data analysis through a multidimensional data model, according to which data facts are viewed as points in a space of application-related dimensions", or...
138
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...