Sciweavers

880 search results - page 69 / 176
» The SLAM problem: a survey
Sort
View
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 11 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
COMCOM
2006
150views more  COMCOM 2006»
15 years 6 months ago
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. ...
Mihaela Cardei, Jie Wu
HICSS
2005
IEEE
123views Biometrics» more  HICSS 2005»
15 years 12 months ago
Enterprise Architecting: Critical Problems
An enterprise architecture (EA) identifies the main components of the organization, its information systems, the ways in which these components work together in order to achieve d...
Stephen H. Kaisler, Frank Armour, Michael Valivull...
4OR
2008
79views more  4OR 2008»
15 years 6 months ago
MIP-based heuristic for non-standard 3D-packing problems
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
Giorgio Fasano
HEURISTICS
2010
15 years 3 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill