Sciweavers

4966 search results - page 833 / 994
» its 2010
Sort
View
SPAA
2010
ACM
15 years 11 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
SYSTOR
2010
ACM
15 years 11 months ago
On the DMA mapping problem in direct device assignment
I/O intensive workloads running in virtual machines can suffer massive performance degradation. Direct assignment of I/O devices to virtual machines is the best performing I/O vir...
Ben-Ami Yassour, Muli Ben-Yehuda, Orit Wasserman
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
15 years 11 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolving the placement and density of neurons in the hyperneat substrate
The Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach demonstrated that the pattern of weights across the connectivity of an artificial neural network ...
Sebastian Risi, Joel Lehman, Kenneth O. Stanley
ICSE
2010
IEEE-ACM
15 years 11 months ago
From behaviour preservation to behaviour modification: constraint-based mutant generation
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
Friedrich Steimann, Andreas Thies