4131 search results - page 39 / 827 » The Generalized Max-Controlled Set Problem |
120
click to vote
APIN
2004
15 years 1 months ago
2004
In this paper we are concerned with the problem of learning how to solve planning problems in one domain given a number of solved instances. This problem is formulated as the probl...
103
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
129
click to vote
SIGMETRICS
2010
ACM
15 years 2 months ago
2010
ACM
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
ALGORITHMICA
2004
15 years 1 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
170
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...