Sciweavers

7109 search results - page 381 / 1422
» Process Algebra with Combinators
Sort
View
LISP
2002
107views more  LISP 2002»
15 years 6 months ago
Dependent Types for Program Termination Verification
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
Hongwei Xi
126
Voted
TVLSI
1998
95views more  TVLSI 1998»
15 years 6 months ago
Bounds on pseudoexhaustive test lengths
Abstract—Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we ...
Rajagopalan Srinivasan, Sandeep K. Gupta, Melvin A...
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
15 years 5 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake
JACM
2010
116views more  JACM 2010»
15 years 5 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
SIAMDM
2010
84views more  SIAMDM 2010»
15 years 5 months ago
Complementary Iterated Floor Words and the Flora Game
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...
Aviezri S. Fraenkel