413 search results - page 15 / 83 » Computing and Exploiting Tree-Decompositions for Solving Con... |
145
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
109
click to vote
SPDP
1991
IEEE
15 years 4 months ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
125
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
119
click to vote
NETWORKS
2007
15 years 26 days ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
102
click to vote
CISS
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...