6514 search results - page 1090 / 1303 » Low-Knowledge Algorithm Control |
139
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
156
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
121
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
117
Voted
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
The core of a cooperative game contains all stable distributions of a coalition’s gains among its members. However, some games have an empty core, with every distribution being ...
130
Voted
NOSSDAV
2009
Springer
15 years 9 months ago
2009
Springer
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...