Sciweavers

110 search results - page 16 / 22
» Chain polynomials and Tutte polynomials
Sort
View
ECAI
2008
Springer
13 years 9 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague
LICS
2009
IEEE
14 years 2 months ago
Statistic Analysis for Probabilistic Processes
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
Michel de Rougemont, Mathieu Tracol
IPPS
2003
IEEE
14 years 25 days ago
Master-slave Tasking on Heterogeneous Processors
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
Pierre-François Dutot
CPAIOR
2010
Springer
14 years 11 days ago
The Increasing Nvalue Constraint
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca...
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law