Sciweavers

FAC
2008
117views more  FAC 2008»
13 years 9 months ago
Model checking Duration Calculus: a practical approach
Abstract. Model checking of real-time systems against Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. The existing algo...
Roland Meyer, Johannes Faber, Jochen Hoenicke, And...
BIOINFORMATICS
2006
106views more  BIOINFORMATICS 2006»
13 years 9 months ago
Identification of biochemical networks by S-tree based genetic programming
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
Dong-Yeon Cho, Kwang-Hyun Cho, Byoung-Tak Zhang
AUTOMATICA
2006
109views more  AUTOMATICA 2006»
13 years 9 months ago
Closed-loop subspace identification using the parity space
It is known that many subspace algorithms give biased estimates for closed-loop data due to the existence of feedback. In this paper we present a new subspace identification metho...
Jin Wang, S. Joe Qin
AUTOMATICA
2006
137views more  AUTOMATICA 2006»
13 years 9 months ago
A Newton-like method for solving rank constrained linear matrix inequalities
This paper presents a Newton-like algorithm for solving systems of rank constrained linear matrix inequalities. Though local quadratic convergence of the algorithm is not a priori...
Robert Orsi, Uwe Helmke, John B. Moore
APPML
2006
120views more  APPML 2006»
13 years 9 months ago
Inversion of general tridiagonal matrices
In the current work, the authors present a symbolic algorithm for finding the inverse of any general nonsingular tridiagonal matrix. The algorithm is mainly based on the work pres...
Moawwad E. A. El-Mikkawy, Abdelrahman Karawia
ENTCS
2008
68views more  ENTCS 2008»
13 years 9 months ago
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discre...
Pieter Collins, Alexandre Goldsztejn
ANOR
2006
69views more  ANOR 2006»
13 years 9 months ago
A splitting method for stochastic programs
This paper derives a new splitting-based decomposition algorithm for convex stochastic programs. It combines certain attractive features of the progressive hedging algorithm of Roc...
Teemu Pennanen, Markku Kallio
ENTCS
2008
123views more  ENTCS 2008»
13 years 9 months ago
A Multi-Core Solver for Parity Games
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal
Jaco van de Pol, Michael Weber 0002
ENTCS
2008
97views more  ENTCS 2008»
13 years 9 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
AMC
2006
115views more  AMC 2006»
13 years 9 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...