Sciweavers

5210 search results - page 201 / 1042
» Exact geometric computation
Sort
View
CONCUR
2001
Springer
15 years 10 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
ICRA
2006
IEEE
141views Robotics» more  ICRA 2006»
16 years 3 days ago
Computing 3-legged Equilibrium Stances in Three-dimensional Gravitational Environments
— Quasistatic multi-legged locomotion consists of a sequence of equilibrium postures where the mechanism supports itself against gravity while moving free limbs to new positions....
Yizhar Or, Elon Rimon
ALMOB
2006
80views more  ALMOB 2006»
15 years 6 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
TCAD
1998
95views more  TCAD 1998»
15 years 5 months ago
A framework for comparing models of computation
—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general term...
Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
16 years 22 days ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh