173 search results - page 32 / 35 » Bounds and Heuristics for the Shortest Capacitated Paths Pro... |
EOR
2006
13 years 7 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
SECON
2008
IEEE
14 years 1 months ago
2008
IEEE
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...
ISPD
2012
ACM
12 years 3 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
SIGCOMM
1999
ACM
13 years 11 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...