Sciweavers

1512 search results - page 69 / 303
» connection 2006
Sort
View
COCO
2006
Springer
65views Algorithms» more  COCO 2006»
15 years 1 months ago
An Isomorphism between Subexponential and Parameterized Complexity Theory
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
Yijia Chen, Martin Grohe
AIIDE
2006
14 years 11 months ago
Procedural Level Design for Platform Games
Although other genres have used procedural level generation to extend gameplay and replayability, platformer games have not yet seen successful level generation. This paper propos...
Kate Compton, Michael Mateas
ERSA
2006
114views Hardware» more  ERSA 2006»
14 years 11 months ago
Architectural Support for Runtime 2D Partial Reconfiguration
: Traditional FPGA architectures can potentially allow the dynamic swap in and out of hardware tasks through 2D partial reconfiguration. A segmented bus structure is proposed to be...
Fei Wang, Jack S. N. Jean
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
14 years 9 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
76
Voted
APPML
2006
73views more  APPML 2006»
14 years 9 months ago
Threshold arrangements and the knapsack problem
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
Günter Rote, André Schulz