18306 search results - page 472 / 3662 » Algorithmics in Exponential Time |
184
click to vote
DSN
2006
IEEE
16 years 1 months ago
2006
IEEE
We present three algorithms for detecting the need for software rejuvenation by monitoring the changing values of a customer-affecting performance metric, such as response time. A...
164
click to vote
ASPDAC
2004
ACM
15 years 11 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
191
click to vote
EVOW
2007
Springer
16 years 1 months ago
2007
Springer
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
188
Voted
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
197
click to vote
ISAAC
1997
Springer
15 years 11 months ago
1997
Springer
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...