10909 search results - page 609 / 2182 » Evaluating Backup Algorithms |
173
click to vote
ISCAS
2005
IEEE
16 years 22 days ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
204
click to vote
ARCS
2005
Springer
16 years 21 days ago
2005
Springer
Data fusion concepts are a necessary basis for utilizing complex networks of sensors. A key feature for a robust data fusion system is adaptivity, both to be fault-tolerant and to...
195
click to vote
CP
2005
Springer
16 years 21 days ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
182
click to vote
MICAI
2005
Springer
16 years 19 days ago
2005
Springer
In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Cr...
198
click to vote
PKDD
2005
Springer
16 years 19 days ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...