1968 search results - page 182 / 394 » The Complexity of Valued Constraint Models |
128
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
108
Voted
DATE
2003
IEEE
15 years 7 months ago
2003
IEEE
Temporal specification languages provide an efficient way to express events comprised of complex temporal scenarios. Assertions based on these languages are used to detect viola...
WSC
2007
15 years 4 months ago
2007
A new approach for overcoming broken ergodicity in Markov Chain Monte Carlo (MCMC) simulations of complex systems is described. The problem of broken ergodicity is often present i...
99
Voted
UAI
2004
15 years 3 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
108
Voted
WSC
2004
15 years 3 months ago
2004
Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of by tossing a needle onto striped paper) to analyze phenomena which, due to ...