Sciweavers

414 search results - page 17 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
MP
2011
14 years 4 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
14 years 11 months ago
Convex formulations of aggregate network air traffic flow optimization problems
The problem of regulating air traffic in the en route airspace of the National Airspace System is studied using an Eulerian network model to describe air traffic flow. The evolutio...
Daniel B. Work, Alexandre M. Bayen
ISPD
1999
ACM
92views Hardware» more  ISPD 1999»
15 years 1 months ago
Crosstalk constrained global route embedding
- Route Embedding, a new method for mitigating the impact of crosstalk, is presented. It modifies a set of global-route structures to prevent timing and noise-margin violations ca...
Phiroze N. Parakh, Richard B. Brown
76
Voted
EMNLP
2008
14 years 11 months ago
Jointly Combining Implicit Constraints Improves Temporal Ordering
Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...
Nathanael Chambers, Daniel Jurafsky
COCOA
2008
Springer
14 years 11 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati