12015 search results - page 686 / 2403 » Interactive Algorithms 2005 |
176
click to vote
FPL
2005
Springer
16 years 28 days ago
2005
Springer
Current FPGA placement algorithms estimate the routability of a placement using architecture-specific metrics. The shortcoming of using architecture-specific routability estimates ...
168
Voted
GECCO
2005
Springer
16 years 28 days ago
2005
Springer
We explore the use of information models as a guide for the development of single objective optimization algorithms, giving particular attention to the use of Bayesian models in a...
160
click to vote
ICALP
2005
Springer
16 years 28 days ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
180
Voted
VLSM
2005
Springer
16 years 26 days ago
2005
Springer
In this paper we present a simple modification of the Fast Marching algorithm to speed up the computation using a heuristic. This modification leads to an algorithm that is simil...
206
click to vote
WDAG
2005
Springer
16 years 26 days ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...