18306 search results - page 489 / 3662 » Algorithmics in Exponential Time |
201
click to vote
HYBRID
2010
Springer
16 years 2 months ago
2010
Springer
We consider an anytime control algorithm for the situation when the processor resource availability is time-varying. The basic idea is to calculate the components of the control i...
211
click to vote
INTEGRATION
2007
15 years 7 months ago
2007
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
217
click to vote
TCAD
2002
15 years 7 months ago
2002
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
213
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
211
click to vote
CP
2003
Springer
16 years 25 days ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...