54 search results - page 6 / 11 » Solving The Multi-Constrained Path Selection Problem By Usin... |
KR
1992
Springer
13 years 11 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
IANDC
2008
13 years 7 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
RTSS
2005
IEEE
14 years 1 months ago
2005
IEEE
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
IMC
2009
ACM
14 years 2 months ago
2009
ACM
Replicating content across a geographically distributed set of servers and redirecting clients to the closest server in terms of latency has emerged as a common paradigm for impro...
ISAAC
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...