Sciweavers

784 search results - page 105 / 157
» Relaxing the Value Restriction
Sort
View
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 2 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
SENSYS
2003
ACM
14 years 2 months ago
Spatiotemporal multicast in sensor networks
Sensor networks often involve the monitoring of mobile phenomena. We believe this task can be facilitated by a spatiotemporal multicast protocol which we call “mobicast”. Mobi...
Qingfeng Huang, Chenyang Lu, Gruia-Catalin Roman
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh
AIPS
2010
13 years 11 months ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
PPSN
2010
Springer
13 years 7 months ago
Defining and Optimizing Indicator-Based Diversity Measures in Multiobjective Search
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...
Tamara Ulrich, Johannes Bader, Lothar Thiele