Sciweavers

957 search results - page 113 / 192
» Addition Chain Heuristics
Sort
View
JVCA
2007
128views more  JVCA 2007»
14 years 11 months ago
Impulse-based dynamic simulation in linear time
This paper describes an impulse-based dynamic simulation method for articulated bodies which has a linear time complexity. Existing linear-time methods are either based on a reduc...
Jan Bender
AI
2000
Springer
14 years 11 months ago
Model-based reasoning about learner behaviour
Automated handling of tutoring and training functions in educational systems requires the availability of articulate domain models. In this article we further develop the applicat...
Kees de Koning, Bert Bredeweg, Joost Breuker, Bob ...
TCAD
1998
91views more  TCAD 1998»
14 years 11 months ago
Cost-free scan: a low-overhead scan path design
Conventional scan design imposes considerable area and delay overhead by using larger scan ip- ops and additional scan wires without utilizing the functionality of the combinatio...
Chih-Chang Lin, Malgorzata Marek-Sadowska, Mike Ti...
IANDC
2010
116views more  IANDC 2010»
14 years 10 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
IPL
2010
112views more  IPL 2010»
14 years 10 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...