11328 search results - page 133 / 2266 » Timed Branching Processes |
122
Voted
CGO
2004
IEEE
15 years 7 months ago
2004
IEEE
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...
139
click to vote
FLAIRS
2008
15 years 5 months ago
2008
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...
127
Voted
DAGSTUHL
2004
15 years 4 months ago
2004
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...
137
Voted
UAI
2004
15 years 4 months ago
2004
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 ...
125
Voted
UAI
2003
15 years 4 months ago
2003
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...