Sciweavers

1518 search results - page 199 / 304
» Exact and Approximate Bandwidth
Sort
View
SODA
2010
ACM
145views Algorithms» more  SODA 2010»
14 years 8 months ago
On the Equilibria of Alternating Move Games
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
Aaron Roth, Maria-Florina Balcan, Adam Kalai, Yish...
FSTTCS
2010
Springer
14 years 8 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
14 years 7 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
14 years 5 months ago
Motion planning in quantum control via intersection of eigenvalues
In this paper we consider the problem of inducing a transition in a controlled quantum mechanical system whose spectrum loses simplicity for some values of the control. We study th...
Ugo V. Boscain, Francesca C. Chittaro, Paolo Mason...
CDC
2010
IEEE
163views Control Systems» more  CDC 2010»
14 years 4 months ago
A projection framework for near-potential games
Potential games are a special class of games that admit tractable static and dynamic analysis. Intuitively, games that are "close" to a potential game should enjoy somewh...
Ozan Candogan, Asuman E. Ozdaglar, Pablo A. Parril...