Sciweavers

5153 search results - page 14 / 1031
» Introduction to Randomized Algorithms
Sort
View
UPP
2004
Springer
15 years 3 months ago
Inverse Design of Cellular Automata by Genetic Algorithms: An Unconventional Programming Paradigm
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
Thomas Bäck, Ron Breukelaar, Lars Willmes
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 3 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
INFOCOM
2012
IEEE
13 years 2 days ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley
DAC
2001
ACM
15 years 10 months ago
MetaCores: Design and Optimization Techniques
Currently, hardware intellectual property (IP) is delivered at vels of abstraction: hard, firm, and soft. In order to further enhance performance, efficiency, and flexibility of I...
Seapahn Meguerdichian, Farinaz Koushanfar, Advait ...