Sciweavers

2446 search results - page 227 / 490
» Choiceless Polynomial Time
Sort
View
BIRTHDAY
2009
Springer
14 years 3 months ago
Asynchronous Congestion Games
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
IEEECGIV
2009
IEEE
14 years 2 months ago
Monomial Forms for Curves in CAGD with their Applications
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
Chanon Aphirukmatakun, Natasha Dejdumrong
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
14 years 2 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
14 years 2 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
INFOCOM
2008
IEEE
14 years 2 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff