1089 search results - page 84 / 218 » Randomness and Reducibility |
112
click to vote
COMPSAC
2009
IEEE
15 years 4 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...
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
101
click to vote
EDBT
2010
ACM
15 years 3 months ago
2010
ACM
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
112
click to vote
AAAI
2008
15 years 2 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...
112
click to vote
FLAIRS
2007
15 years 2 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...