Sciweavers

64 search results - page 8 / 13
» Quantum walk based search algorithms
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
AMDO
2000
Springer
13 years 11 months ago
Matching a Human Walking Sequence with a VRML Synthetic Model
- In this paper we present a specific matching technique based on basic motor patterns between two image sequences taken from different view points and a VRML synthetic human model...
Jose Maria Buades Rubio, Ramon Mas, Francisco J. P...
ICANNGA
2007
Springer
13 years 11 months ago
Particle Swarms for Multimodal Optimization
Abstract. In this paper, five previous Particle Swarm Optimization (PSO) algorithms for multimodal function optimization are reviewed. A new and a successful PSO based algorithm, n...
Ender Özcan, Murat Yilmaz
SEFM
2007
IEEE
14 years 1 months ago
Hardness for Explicit State Software Model Checking Benchmarks
Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their per...
Neha Rungta, Eric G. Mercer
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya