Sciweavers

2479 search results - page 323 / 496
» Quantum complexity theory
Sort
View
MST
2010
187views more  MST 2010»
15 years 1 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
INFOCOM
2011
IEEE
14 years 10 months ago
Understanding robustness of mobile networks through temporal network measures
—The application of complex network theory to communication systems has led to several important results. Nonetheless, previous research has often neglected to take into account ...
Salvatore Scellato, Ilias Leontiadis, Cecilia Masc...
ATAL
2011
Springer
14 years 6 months ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....
MOBICOM
2012
ACM
13 years 9 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
PODS
1995
ACM
139views Database» more  PODS 1995»
15 years 10 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin