Sciweavers

3780 search results - page 163 / 756
» Algorithms for Game Metrics
Sort
View
147
Voted
CDC
2010
IEEE
149views Control Systems» more  CDC 2010»
15 years 1 days ago
Nonuniform coverage and cartograms
In this paper, we investigate nonuniform coverage of a planar region by a network of autonomous, mobile agents. We derive centralized nonuniform coverage control laws from uniform ...
Francois Lekien, Naomi Ehrich Leonard
179
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Discrete regression methods on the cone of positive-definite matrices
We consider the problem of fitting a discrete curve to time-labeled data points on the set Pn of all n-by-n symmetric positive-definite matrices. The quality of a curve is measu...
Nicolas Boumal, Pierre-Antoine Absil
ATAL
2009
Springer
15 years 11 months ago
Adversarial search with procedural knowledge heuristic
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
Viliam Lisý, Branislav Bosanský, Mic...
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 6 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 6 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber