Sciweavers

16666 search results - page 2702 / 3334
» Descriptive and Computational Complexity
Sort
View
JCB
2007
94views more  JCB 2007»
15 years 7 months ago
Locality and Gaps in RNA Comparison
Locality is an important and well-studied notion in comparative analysis of biological sequences. Similarly, taking into account affine gap penalties when calculating biological ...
Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M...
TNN
2008
124views more  TNN 2008»
15 years 7 months ago
Just-in-Time Adaptive Classifiers - Part II: Designing the Classifier
Aging effects, environmental changes, thermal drifts, and soft and hard faults affect physical systems by changing their nature and behavior over time. To cope with a process evolu...
Cesare Alippi, Manuel Roveri
AROBOTS
2002
115views more  AROBOTS 2002»
15 years 7 months ago
Statistical Learning for Humanoid Robots
The complexity of the kinematic and dynamic structure of humanoid robots make conventional analytical approaches to control increasingly unsuitable for such systems. Learning techn...
Sethu Vijayakumar, Aaron D'Souza, Tomohiro Shibata...
CI
2000
114views more  CI 2000»
15 years 7 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
CORR
2007
Springer
217views Education» more  CORR 2007»
15 years 7 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
« Prev « First page 2702 / 3334 Last » Next »