94 search results - page 5 / 19 » Approximating covering problems by randomized search heurist... |
WSC
1998
13 years 9 months ago
1998
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this p...
HICSS
1997
IEEE
14 years 5 days ago
1997
IEEE
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...
ASPDAC
2007
ACM
13 years 12 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
IJSNET
2006
13 years 8 months ago
2006
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
WSC
2008
13 years 10 months ago
2008
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...