13987 search results - page 135 / 2798 » The Two Guards Problem |
158
Voted
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
147
click to vote
JCO
2008
15 years 3 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
129
click to vote
HEURISTICS
2002
15 years 3 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
178
click to vote
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
127
click to vote
ICTAI
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper deals with the multi-agent patrolling problem in unknown environment using two collective approaches exploiting environmental dynamics. After specifying criteria of per...