1594 search results - page 51 / 319 » An Algorithm to Compute Collusion Paths |
114
click to vote
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
105
click to vote
PAM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. While several algorithms have been created to actively measure the end-to-end available bandwidth of a network path, they require instrumentation at both ends of the path...
117
click to vote
PPSN
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...