3221 search results - page 265 / 645 » Termination of Linear Programs |
155
click to vote
BIRTHDAY
1994
Springer
15 years 10 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
196
click to vote
CASES
2004
ACM
15 years 10 months ago
2004
ACM
New heterogeneous multiprocessor platforms are emerging that are typically composed of loosely coupled components that exchange data using programmable interconnections. The compon...
184
click to vote
ORL
2000
15 years 6 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
282
click to vote
TCAD
2011
15 years 1 months ago
2011
Abstract—This work introduces GRIP, a global routing technique via integer programming. GRIP optimizes wirelength and via cost directly without going through a traditional layer ...
183
click to vote
LPNMR
2001
Springer
15 years 11 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...