Results 1 - 10 of 49,848

Symbolic Model Checking: 10^20 States and Beyond

by J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, L. J. Hwang , 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract - Cited by 758 (41 self) - Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number

Impulses and Physiological States in Theoretical Models of Nerve Membrane

by Richard Fitzhugh - Biophysical Journal , 1961
"... ABSTRACT Van der Pol's equation for a relaxation oscillator is generalized by the addition of terms to produce a pair of non-linear differential equations with either a stable singular point or a limit cycle. The resulting "BVP model " has two variables of state, representing excitabi ..."
Abstract - Cited by 505 (0 self) - Add to MetaCart
the 4-dimensional HH phase space onto a plane produces a similar diagram which shows the underlying relationship between the two models. Impulse trains occur in the BVP and HH models for a range of constant applied currents which make the singular point representing the resting state unstable.

Space-time codes for high data rate wireless communication: Performance criterion and code construction

by Vahid Tarokh, Nambi Seshadri, A. R. Calderbank - IEEE TRANS. INFORM. THEORY , 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract - Cited by 1782 (28 self) - Add to MetaCart
are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2–3 dB of the outage capacity for these channels using only 64 state encoders.

The Theory of Hybrid Automata

by Thomas A. Henzinger , 1996
"... A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied on pur ..."
Abstract - Cited by 685 (12 self) - Add to MetaCart
A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied

Randomized kinodynamic planning

by Steven M. Lavalle, James J. Kuffner, Jr. - THE INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH 2001; 20; 378 , 2001
"... This paper presents the first randomized approach to kinodynamic planning (also known as trajectory planning or trajectory design). The task is to determine control inputs to drive a robot from an initial configuration and velocity to a goal configuration and velocity while obeying physically based ..."
Abstract - Cited by 626 (35 self) - Add to MetaCart
dynamical models and avoiding obstacles in the robot’s environment. The authors consider generic systems that express the nonlinear dynamics of a robot in terms of the robot’s high-dimensional configuration space. Kinodynamic planning is treated as a motion-planning problem in a higher dimensional state

Fast and accurate short read alignment with Burrows-Wheeler transform

by Heng Li, Richard Durbin - BIOINFORMATICS, 2009, ADVANCE ACCESS , 2009
"... Motivation: The enormous amount of short reads generated by the new DNA sequencing technologies call for the development of fast and accurate read alignment programs. A first generation of hashtable based methods has been developed, including MAQ, which is accurate, feature rich and fast enough to a ..."
Abstract - Cited by 2096 (24 self) - Add to MetaCart
Motivation: The enormous amount of short reads generated by the new DNA sequencing technologies call for the development of fast and accurate read alignment programs. A first generation of hashtable based methods has been developed, including MAQ, which is accurate, feature rich and fast enough

Symbolic Model Checking for Real-time Systems

by Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - INFORMATION AND COMPUTATION , 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract - Cited by 578 (50 self) - Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a -calculus on computation trees over real-numbered time. Unfortunately

The algorithmic analysis of hybrid systems

by R. Alur, C. Courcoubetis, N. Halbwachs , T. A. Henzinger, P.-H. Ho, X. Nicollin , A. Olivero , J. Sifakis , S. Yovine - THEORETICAL COMPUTER SCIENCE , 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract - Cited by 778 (71 self) - Add to MetaCart
to linear hybrid systems. In particular, we consider symbolic model-checking and minimization procedures that are based on the reachability analysis of an infinite state space. The procedures iteratively compute state sets that are definable as unions of convex polyhedra in multidimensional real space. We

Computing semantic relatedness using Wikipedia-based explicit semantic analysis

by Evgeniy Gabrilovich, Shaul Markovitch - In Proceedings of the 20th International Joint Conference on Artificial Intelligence , 2007
"... Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a high-dimensional space of concepts derived from Wikipedi ..."
Abstract - Cited by 562 (9 self) - Add to MetaCart
Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a high-dimensional space of concepts derived from

The FF planning system: Fast plan generation through heuristic search

by Jörg Hoffmann, Bernhard Nebel - Journal of Artificial Intelligence Research , 2001
"... We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be ind ..."
Abstract - Cited by 830 (55 self) - Add to MetaCart
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts
Results 1 - 10 of 49,848