Sciweavers

3172 search results - page 138 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
AUTOMATICA
2002
130views more  AUTOMATICA 2002»
15 years 6 months ago
Controllability and reachability criteria for switched linear systems
This paper investigates the controllability and reachability of switched linear control systems. It is proven that both the controllable and reachable sets are subspaces of the to...
Zhendong Sun, Shuzhi Sam Ge, Tong Heng Lee
JMM2
2006
80views more  JMM2 2006»
15 years 6 months ago
Implementing Holistic Dimensions for a Facial Composite System
Facial composites are pictures of human faces. These are normally constructed by victims and witnesses of crime who describe a suspect's face and then select individual facial...
Charlie D. Frowd, Vicki Bruce, Alex H. McIntyre, D...
ESWS
2009
Springer
16 years 1 months ago
Evolva: A Comprehensive Approach to Ontology Evolution
Ontology evolution is increasingly gaining momentum in the area of Semantic Web research. Current approaches target the evolution in terms of either content, or change management, ...
Fouad Zablith
ESOP
2001
Springer
15 years 11 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
CP
2000
Springer
15 years 10 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen