3946 search results - page 675 / 790 » The computational complexity of choice sets |
182
click to vote
AAAI
2006
15 years 7 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
169
click to vote
AAAI
2004
15 years 7 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
175
click to vote
AAAI
2006
15 years 7 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
195
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
177
click to vote
FLAIRS
2004
15 years 7 months ago
2004
Within the geographic domain, an important class of relies on geometric abstractions in the form of lines where, for instance, transportation networks and trajectories of movement...