1492 search results - page 121 / 299 » Testing Properties of Constraint-Graphs |
142
click to vote
ICOIN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
130
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
115
Voted
DFT
2002
IEEE
15 years 9 months ago
2002
IEEE
IDDQ test loses its effectiveness for deep sub-micron chips since it cannot distinguish between faulty and fault-free currents. The concept of current ratios, in which the ratio o...
134
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— Rigidity of formation is an importance concept in multi-agent localization and control problems. There are welldeveloped existing methods to test the rigidity of a given graph....
132
click to vote
CAIP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Interaction increases flexibility of segmentation but it leads to undesirable behaviour of an algorithm if knowledge being requested is inappropriate. In region growing, ...