350 search results - page 66 / 70 » Lower and upper bounds on obtaining history independence |
PODC
2004
ACM
15 years 5 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
112
click to vote
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
COR
2010
14 years 11 months ago
2010
: 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...
84
Voted
AAAI
2012
2012
Automatic Targetless Extrinsic Calibration of a 3D Lidar and Camera by Maximizing Mutual Information
13 years 2 months ago
This paper reports on a mutual information (MI) based algorithm for automatic extrinsic calibration of a 3D laser scanner and optical camera system. By using MI as the registratio...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...