Sciweavers

18 search results - page 3 / 4
» The bi-objective covering tour problem
Sort
View
MP
2006
138views more  MP 2006»
13 years 5 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
AINA
2010
IEEE
13 years 11 months ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
COCOON
2005
Springer
13 years 11 months ago
Exploring Simple Grid Polygons
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
TASE
2010
IEEE
13 years 15 days ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SAT
2004
Springer
113views Hardware» more  SAT 2004»
13 years 11 months ago
Clause Form Conversions for Boolean Circuits
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
Paul Jackson, Daniel Sheridan