9842 search results - page 1287 / 1969 » The Complexity of the Matching-Cut Problem |
166
click to vote
EVOW
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario...
193
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of d...
183
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
199
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
157
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...