5263 search results - page 852 / 1053 » Open Constraint Optimization |
163
Voted
PODC
2003
ACM
16 years 8 days ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
179
click to vote
MICRO
2002
IEEE
15 years 12 months ago
2002
IEEE
With the prevalence of server blades and systems-ona-chip (SoCs), interconnection networks are becoming an important part of the microprocessor landscape. However, there is limite...
222
click to vote
STOC
2010
ACM
15 years 12 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
165
click to vote
GECCO
2010
Springer
15 years 12 months ago
2010
Springer
HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a ionally efficient high-level abstraction of development....
240
Voted
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...