Sciweavers

706 search results - page 110 / 142
» An Integer Linear Programming Approach to Database Design
Sort
View
91
Voted
ICC
2008
IEEE
163views Communications» more  ICC 2008»
15 years 5 months ago
Network Coding Aware Dynamic Subcarrier Assignment in OFDMA Wireless Networks
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
Xinyu Zhang, Baochun Li
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 3 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 2 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
COR
2008
111views more  COR 2008»
14 years 11 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
91
Voted
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
14 years 9 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King