Sciweavers

1263 search results - page 103 / 253
» A* with Bounded Costs
Sort
View
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 10 months ago
Graph Coloring with Rejection
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
OPODIS
2004
15 years 7 months ago
Fast Localized Delaunay Triangulation
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
Filipe Araújo, Luís Rodrigues
COR
2010
116views more  COR 2010»
15 years 6 months ago
The multi-shift vehicle routing problem with overtime
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...
SAGT
2010
Springer
119views Game Theory» more  SAGT 2010»
15 years 4 months ago
Minimal Subsidies in Expense Sharing Games
A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such ...
Reshef Meir, Yoram Bachrach, Jeffrey S. Rosenschei...
ICPR
2004
IEEE
16 years 7 months ago
Analysis of Rotational Robustness of Hand Detection with a Viola-Jones Detector
The research described in this paper analyzes the in-plane rotational robustness of the Viola-Jones object detection method when used for hand appearance detection. We determine t...
Mathias Kölsch, Matthew Turk