Sciweavers

170 search results - page 8 / 34
» On computational properties of chains of recurrences
Sort
View
ICPR
2010
IEEE
14 years 2 months ago
A Graph Matching Algorithm using Data-Driven Markov Chain Monte Carlo Sampling
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
Jungmin Lee, Minsu Cho, Kyoung Mu Lee
BIRTHDAY
2008
Springer
13 years 9 months ago
Temporal Verification of Probabilistic Multi-Agent Systems
Abstract. Probabilistic systems of interacting intelligent agents are considered. They have two sources of uncertainty: uncertainty of communication channels and uncertainty of act...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...
ORDER
2010
110views more  ORDER 2010»
13 years 5 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
14 years 19 days ago
Variable delay ripple carry adder with carry chain interrupt detection
Various implementations are known for the efficient implementation of adders. As opposed to traditional optimization techniques a statistical approach using early termination det...
Andreas Burg, Frank K. Gürkaynak, Hubert Kaes...
SAINT
2005
IEEE
14 years 28 days ago
A Matrix Pattern Compliant Strong Stochastic Bound
Stochastic bounds are a promising method to analyze QoS requirements. Indeed it is sufficient to prove that a bound of the real performance satisfies the guarantee. However, the...
Ana Busic, Jean-Michel Fourneau