7106 search results - page 819 / 1422 » Restricted Complexity, General Complexity |
183
click to vote
ALMOB
2006
15 years 7 months ago
2006
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...
207
click to vote
EOR
2008
15 years 7 months ago
2008
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
199
click to vote
FTML
2008
15 years 7 months ago
2008
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
243
click to vote
CG
2007
Springer
15 years 7 months ago
2007
Springer
We present an interactive algorithm to perform continuous collision detection between general deformable models using graphics processors (GPUs). We model the motion of each objec...
204
click to vote
IANDC
2006
15 years 7 months ago
2006
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...