Sciweavers

1941 search results - page 16 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
15 years 12 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
14 years 6 months ago
Generalized multicircumcenter trajectories for optimal design under near-independence
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Rishi Graham, Jorge Cortés
IJBC
2006
91views more  IJBC 2006»
14 years 11 months ago
Limit Cycles for Generalized Abel Equations
This paper deals with the problem of finding upper bounds on the number of periodic solutions of a class of one-dimensional non-autonomous differential equations: those with the r...
Armengol Gasull, Antoni Guillamon
ATAL
2008
Springer
15 years 1 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
WSNA
2003
ACM
15 years 4 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li