Sciweavers

1389 search results - page 212 / 278
» Definability as hypercomputational effect
Sort
View
MST
2006
129views more  MST 2006»
13 years 8 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding
PR
2008
154views more  PR 2008»
13 years 8 months ago
Data-driven decomposition for multi-class classification
This paper presents a new study on a method of designing a multi-class classifier: Data-driven Error Correcting Output Coding (DECOC). DECOC is based on the principle of Error Cor...
Jie Zhou, Hanchuan Peng, Ching Y. Suen
SCL
2008
76views more  SCL 2008»
13 years 8 months ago
Probabilistic output admissible set for systems with time-varying uncertainties
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial ...
Takeshi Hatanaka, Kiyotsugu Takaba
SIAMSC
2008
147views more  SIAMSC 2008»
13 years 8 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
SAC
2006
ACM
13 years 8 months ago
Transforming OCL constraints: a context change approach
Integrity constraints (ICs) play a key role in the definition of conceptual schemas. In the UML, ICs are usually specified as invariants written in the OCL. However, due to the hi...
Jordi Cabot, Ernest Teniente