Sciweavers

14386 search results - page 354 / 2878
» The Chinese Generals Problem
Sort
View
206
Voted
TASE
2008
IEEE
15 years 6 months ago
Mechanism Design for Single Leader Stackelberg Problems and Application to Procurement Auction Design
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
Dinesh Garg, Y. Narahari
ICPR
2008
IEEE
16 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
163
Voted
HEURISTICS
2008
124views more  HEURISTICS 2008»
15 years 6 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
200
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 6 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
JDA
2007
129views more  JDA 2007»
15 years 6 months ago
Approximating the k-traveling repairman problem with repairtimes
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
Raja Jothi, Balaji Raghavachari