4451 search results - page 350 / 891 » On Random Ordering Constraints |
166
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We study the entropy rate of a hidden Markov process (HMP) defined by observing the output of a binary symmetric channel whose input is a first-order binary Markov process. Despit...
254
click to vote
APPROX
2007
Springer
16 years 29 days ago
2007
Springer
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
139
click to vote
WADS
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
186
click to vote
COMPSAC
2009
IEEE
15 years 11 months ago
2009
IEEE
—In continuous integration, a tight integration of test case prioritization techniques and fault-localization techniques may both expose failures faster and locate faults more ef...
189
click to vote
AAAI
2008
15 years 9 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...