14518 search results - page 294 / 2904 » Two Problems for Sophistication |
184
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
220
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
176
click to vote
IJCAI
2003
15 years 8 months ago
2003
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
185
click to vote
ICMAS
2000
15 years 8 months ago
2000
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
164
click to vote
IJCAI
1989
15 years 7 months ago
1989
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...