1640 search results - page 151 / 328 » Conditional Independence Trees |
117
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
126
click to vote
CP
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we describe the design and implementation of CP-VIZ, a generic visualization platform for constraint programming. It provides multiple views to show the search tree, ...
114
click to vote
PR
2010
15 years 28 days ago
2010
The performance of m-out-of-n bagging with and without replacement in terms of the sampling ratio (m/n) is analyzed. Standard bagging uses resampling with replacement to generate ...
119
click to vote
RSA
2010
15 years 28 days ago
2010
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
116
Voted
ASPDAC
2010
ACM
15 years 17 days ago
2010
ACM
Asynchronous on-chip networks are power efficient and tolerant to process variation but they are slower than synchronous on-chip networks. A low latency asynchronous wormhole route...