Sciweavers

2702 search results - page 405 / 541
» Practically Applicable Formal Methods
Sort
View
CONCUR
1999
Springer
14 years 1 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
ICLP
1997
Springer
14 years 1 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
CIKM
2009
Springer
14 years 1 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
ICRA
2000
IEEE
126views Robotics» more  ICRA 2000»
14 years 1 months ago
Identification and Decoupling Control of Flexure Jointed Hexapods
By exploiting properties of the joint space mass-inertia matrix of flexure jointed hexapods, a new decoupling method is proposed. The new decoupling method, through a static input...
Yixin Chen, John E. McInroy
ICANN
1997
Springer
14 years 1 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer