78 search results - page 11 / 16 » Heavy-Tailed Distributions in Combinatorial Search |
IJCAI
2007
13 years 10 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
ICSR
2000
Springer
14 years 5 days ago
2000
Springer
A serious problem of most transformation-based generators is that they are trying to achieve three mutually antagonistic goals simultaneously: 1) deeply factored operators and oper...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
A probabilistic system for recognition of individual objects is presented. The objects to recognize are composed of constellations of features, and features from a same object shar...
CP
2006
Springer
14 years 9 days 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...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...