1594 search results - page 30 / 319 » An Algorithm to Compute Collusion Paths |
106
click to vote
ICCAD
1995
IEEE
15 years 3 months ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
106
click to vote
TVCG
2012
13 years 2 months ago
2012
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
DATE
2002
IEEE
15 years 4 months ago
2002
IEEE
Although algorithm level re-computing techniques can trade-off the detection capability of Concurrent Error Detection (CED) vs. time overhead, it results in 100% time overhead whe...
GECCO
2008
Springer
15 years 24 days ago
2008
Springer
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
VLSM
2005
Springer
15 years 5 months 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...