Sciweavers

3656 search results - page 58 / 732
» Compact Location Problems
Sort
View
SERP
2004
13 years 11 months ago
Locating Features in Distributed Systems
In distributed systems, just as in conventional software, it is often necessary to locate the software components that implement a particular user feature. Several dynamic analysi...
Sharon Simmons, Dennis Edwards, Norman Wilde
WINE
2010
Springer
149views Economy» more  WINE 2010»
13 years 7 months ago
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
Dimitris Fotakis, Christos Tzamos
AIPS
2008
14 years 7 days ago
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
Blaine Nelson, T. K. Satish Kumar
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
14 years 3 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
EOR
2006
91views more  EOR 2006»
13 years 10 months ago
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
A. Miguel Gomes, José F. Oliveira