6409 search results - page 81 / 1282 » A Computational Algorithm for Origami Design |
FPL
2000
Springer
15 years 5 months ago
2000
Springer
Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospect...
141
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Evolutionary Algorithms (EAs) can be used for designing Particle Swarm Optimization (PSO) algorithms that work, in some cases, considerably better than the human-designed ones. By...
113
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
The Internet is different from traditional parallel computing environments, and Distributed Genetic Algorithms (DGAs) for the Internet need to be designed to address these diffe...
124
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...