2370 search results - page 229 / 474 » The Characterization of Data-Accumulating Algorithms |
109
Voted
COCO
2004
Springer
15 years 9 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
132
Voted
COCO
2004
Springer
15 years 9 months ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
112
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
138
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
The paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of ...
111
click to vote
FOIKS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Dimension schemas are abstract models of the data hierarchies that populate OLAP warehouses. Although there is abundant work on schema equivalence in a variety of data mo...