Sciweavers

17789 search results - page 210 / 3558
» Exceptional Use Cases
Sort
View
AUTOMATICA
2006
166views more  AUTOMATICA 2006»
15 years 6 months ago
On admissible pairs and equivalent feedback - Youla parameterization in iterative learning control
This paper revisits a well-known synthesis problem in iterative learning control, where the objective is to optimize a performance criterion over a class of causal iterations. The...
Mark Verwoerd, Gjerrit Meinsma, Theo de Vries
WG
2010
Springer
15 years 4 months ago
Colouring Vertices of Triangle-Free Graphs
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Ber...
WRLA
2010
15 years 4 months ago
Folding Variant Narrowing and Optimal Variant Termination
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
Santiago Escobar, Ralf Sasse, José Meseguer
AAAI
2000
15 years 8 months ago
Dynamic Case Creation and Expansion for Analogical Reasoning
Most CBR systems rely on a fixed library of cases, where each case consists of a set of facts specified in advance. This paper describes techniques for dynamically extracting case...
Thomas Mostek, Kenneth D. Forbus, Cara Meverden
TSE
2002
105views more  TSE 2002»
15 years 6 months ago
Disaggregating and Calibrating the CASE Tool Variable in COCOMO II
CASE (Computer Aided Software Engineering) tools are believed to have played a critical role in improving software productivity and quality by assisting tasks in software developme...
Jongmoon Baik, Barry W. Boehm, Bert Steece