13987 search results - page 339 / 2798 » The Two Guards Problem |
204
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
170
click to vote
VLDB
2007
ACM
16 years 26 days ago
2007
ACM
For a large number of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smalles...
134
click to vote
ICRA
2005
IEEE
16 years 11 days ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
184
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
176
click to vote
COMPSAC
2002
IEEE
15 years 11 months ago
2002
IEEE
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...