Sciweavers

11328 search results - page 133 / 2266
» Timed Branching Processes
Sort
View
CGO
2004
IEEE
15 years 10 months ago
Probabilistic Predicate-Aware Modulo Scheduling
Predicated execution enables the removal of branches by converting segments of branching code into sequences of conditional operations. An important side effect of this transforma...
Mikhail Smelyanskiy, Scott A. Mahlke, Edward S. Da...
FLAIRS
2008
15 years 8 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
DAGSTUHL
2004
15 years 7 months ago
Testing with Functions as Specifications
Although computer systems penetrate all facets of society, the software running those systems may contain many errors. Producing high quality software appears to be difficult and v...
Pieter W. M. Koopman
UAI
2004
15 years 7 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
UAI
2003
15 years 7 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter