4451 search results - page 36 / 891 » On Random Ordering Constraints |
CP
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
64
Voted
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....
VLSID
2002
IEEE
16 years 4 days ago
2002
IEEE
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
85
Voted
ASPDAC
2009
ACM
15 years 6 months ago
2009
ACM
