6829 search results - page 1102 / 1366 » Quantitative Generalizations of Languages |
123
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
132
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
137
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
135
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
123
click to vote
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...