9842 search results - page 1382 / 1969 » The Complexity of the Matching-Cut Problem |
151
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
179
click to vote
AINA
2006
IEEE
16 years 1 months ago
2006
IEEE
Grids have the potential to revolutionize computing by providing ubiquitous, on demand access to computational services and resources. However, grid systems are extremely large, c...
199
click to vote
IROS
2006
IEEE
16 years 1 months ago
2006
IEEE
— An important problem in robotics is planning and selecting actions for goal-directed behavior in noisy uncertain environments. The problem is typically addressed within the fra...
189
click to vote
CIMCA
2005
IEEE
16 years 25 days ago
2005
IEEE
Several methodologies based on Multi-agent Systems (MAS) already exist. They help designers to describe software or to create MAS which aim at solving complex problems by simulati...
160
click to vote
CSB
2005
IEEE
16 years 25 days ago
2005
IEEE
Raising seeds for biological experiments is prone to error; a careful experimenter will test in the lab to verify that plants are of the intended strain. Choosing a minimal set of...