909 search results - page 60 / 182 » On the approximability of some network design problems |
133
click to vote
WINET
2008
15 years 6 months ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
326
click to vote
Publication
Popular myths that cheaper memory, high-speed links and high-speed processors will solve the problem of congestion in computer networks are shown to be false. A simple definition f...
140
click to vote
TON
2010
15 years 26 days ago
2010
Disruption tolerant networks rely on intermittent contacts between mobile nodes to deliver packets using a storecarry-and-forward paradigm. We earlier proposed the use of throwbox ...
154
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
165
click to vote
IPPS
2009
IEEE
16 years 24 days ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...