Sciweavers

3678 search results - page 400 / 736
» On the Stable Paths Problem
Sort
View
IPPS
2003
IEEE
16 years 9 hour ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...
HIPC
2003
Springer
15 years 12 months ago
Delay and Jitter Minimization in High Performance Internet Computing
Delay and jitter management in high performance active computation is a challenging problem in the emerging area of internet computing. The problem takes a complex new form from it...
Javed I. Khan, Seung Su Yang
222
Voted
INFOCOM
2000
IEEE
15 years 11 months ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
ISPD
1999
ACM
106views Hardware» more  ISPD 1999»
15 years 11 months ago
Timing driven maze routing
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
Sung-Woo Hur, Ashok Jagannathan, John Lillis
GLVLSI
1998
IEEE
129views VLSI» more  GLVLSI 1998»
15 years 11 months ago
Tabu Search Based Circuit Optimization
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
Sadiq M. Sait, Habib Youssef, Munir M. Zahra