Sciweavers

732 search results - page 71 / 147
» Termination of Integer Linear Programs
Sort
View
JAIR
2010
99views more  JAIR 2010»
13 years 7 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
CDB
1997
Springer
85views Database» more  CDB 1997»
14 years 1 months ago
On Expressing Topological Connectivity in Spatial Datalog
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
Bart Kuijpers, Marc Smits
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
14 years 1 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»
14 years 20 days 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
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
14 years 3 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth