13987 search results - page 263 / 2798 » The Two Guards Problem |
172
click to vote
COCOON
2005
Springer
15 years 6 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...
150
click to vote
IJCAI
2003
15 years 5 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...
133
click to vote
ICMAS
2000
15 years 5 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...
122
click to vote
IJCAI
1989
15 years 5 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...
152
click to vote
EJC
2008
15 years 4 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...