4488 search results - page 563 / 898 » Properties of NP-Complete Sets |
177
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
211
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
230
click to vote
DASFAA
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
184
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
175
click to vote
AAAI
2004
15 years 8 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...