298 search results - page 54 / 60 » Minimizing Flow Time in the Wireless Gathering Problem |
128
Voted
SIGSOFT
2004
ACM
16 years 4 months ago
2004
ACM
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
145
Voted
ORL
2006
15 years 3 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
169
Voted
MST
2010
14 years 10 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
159
Voted
DMTCS
2010
15 years 28 days ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
129
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...