Sciweavers

1322 search results - page 43 / 265
» Parameterized counting problems
Sort
View
CC
2006
Springer
147views System Software» more  CC 2006»
13 years 8 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
CGO
2010
IEEE
14 years 3 months ago
Parameterized tiling revisited
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
Muthu Manikandan Baskaran, Albert Hartono, Sanket ...
IVA
2010
Springer
13 years 7 months ago
Interactive Motion Modeling and Parameterization by Direct Demonstration
Abstract. While interactive virtual humans are becoming widely used in education, training and therapeutic applications, building animations which are both realistic and parameteri...
Carlo Camporesi, Yazhou Huang, Marcelo Kallmann
GECCO
2004
Springer
14 years 2 months ago
Systematic Integration of Parameterized Local Search Techniques in Evolutionary Algorithms
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
Neal K. Bambha, Shuvra S. Bhattacharyya, Jürg...
JSC
2010
100views more  JSC 2010»
13 years 3 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov