1461 search results - page 248 / 293 » Complexity of Graph Covering Problems |
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
IJCAI
2007
13 years 10 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
EUROPAR
2010
Springer
13 years 10 months ago
2010
Springer
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
GLOBECOM
2008
IEEE
13 years 9 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
AUTOMATICA
2006
13 years 8 months ago
2006
A detailed study on the design of decentralized Receding Horizon Control (RHC) schemes for decoupled systems is presented. An optimal control problem is formulated for a set of de...