Sciweavers

414 search results - page 36 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
IPPS
2003
IEEE
15 years 2 months ago
MIP Formulation for Robust Resource Allocation in Dynamic Real-Time Systems
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
Sethavidh Gertphol, Viktor K. Prasanna
EVOW
2008
Springer
14 years 11 months ago
A Hybrid Column Generation Approach for the Berth Allocation Problem
Abstract. The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a rece...
Geraldo R. Mauri, Alexandre C. M. Oliveira, Luiz A...
CONCUR
2000
Springer
15 years 2 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
GLVLSI
2010
IEEE
154views VLSI» more  GLVLSI 2010»
14 years 11 months ago
Resource-constrained timing-driven link insertion for critical delay reduction
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
Jin-Tai Yan, Zhi-Wei Chen
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
14 years 9 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram