Sciweavers

3758 search results - page 106 / 752
» A Complete Subsumption Algorithm
Sort
View
GBRPR
2007
Springer
15 years 4 months ago
A New Contour Filling Algorithm Based on 2D Topological Map
Abstract. In this paper, we present a topological algorithm which allows to ll contours images. The lling problem has been widely treated and it recently appeared that it can alw...
Guillaume Damiand, Denis Arrivault
IAT
2006
IEEE
15 years 3 months ago
A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
Terence H.-W. Law, Adrian R. Pearce
ARITH
2003
IEEE
15 years 3 months ago
A New Iterative Structure for Hardware Division: The Parallel Paths Algorithm
This paper presents a new approach to hardware division—the parallel paths algorithm. In this approach, prescaling allows the division recurrence to be implemented by three proc...
Eric Rice, Richard Hughey
DFT
1999
IEEE
125views VLSI» more  DFT 1999»
15 years 2 months ago
Algorithms for Efficient Runtime Fault Recovery on Diverse FPGA Architectures
The inherent redundancy and in-the-field reconfiguration capabilities of field programmable gate arrays (FPGAs) provide alternatives to integrated circuit redundancy-based fault r...
John Lach, William H. Mangione-Smith, Miodrag Potk...
CONPAR
1992
15 years 1 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault