Sciweavers

1279 search results - page 103 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
13 years 3 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
ICRA
2009
IEEE
100views Robotics» more  ICRA 2009»
13 years 6 months ago
Multi-robot plan adaptation by constrained minimal distortion feature mapping
We propose a novel method for multi-robot plan adaptation which can be used for adapting existing spatial plans of robotic teams to new environments or imitating collaborative spat...
Bálint Takács, Yiannis Demiris
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 3 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
FCT
2005
Springer
14 years 2 months ago
The Maximum Resource Bin Packing Problem
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens ...
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
14 years 2 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev