Sciweavers

451 search results - page 3 / 91
» On Parameterized Exponential Time Complexity
Sort
View
VC
2008
131views more  VC 2008»
13 years 7 months ago
Motion synthesis with decoupled parameterization
In real-time animation systems, motion interpolation techniques are widely used for their controllability and efficiency. The techniques sample the parameter space using example mo...
Dongwook Ha, JungHyun Han
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 4 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
DATE
2004
IEEE
154views Hardware» more  DATE 2004»
13 years 11 months ago
Fast Exploration of Parameterized Bus Architecture for Communication-Centric SoC Design
For successful SoC design, efficient and scalable communication architecture is crucial. Some bus interconnects now provide configurable structures to meet this requirement of an ...
Chulho Shin, Young-Taek Kim, Eui-Young Chung, Kyu-...
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
13 years 11 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...