Sciweavers

134 search results - page 12 / 27
» An Optimal Rebuilding Strategy for an Incremental Tree Probl...
Sort
View
CP
2010
Springer
14 years 9 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
89
Voted
HPCC
2005
Springer
15 years 4 months ago
On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation
With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to op...
Youngjin Ahn, Moonseong Kim, Young-Cheol Bang, Hyu...
CGO
2007
IEEE
15 years 5 months ago
On the Complexity of Register Coalescing
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
Florent Bouchez, Alain Darte, Fabrice Rastello
ISMIS
2000
Springer
15 years 2 months ago
Prediction of Ordinal Classes Using Regression Trees
This paper is devoted to the problem of learning to predict ordinal (i.e., ordered discrete) classes using classification and regression trees. We start with S-CART, a tree inducti...
Stefan Kramer, Gerhard Widmer, Bernhard Pfahringer...
ICCS
2007
Springer
15 years 5 months ago
Impact of QoS on Replica Placement in Tree Networks
This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, wh...
Anne Benoit, Veronika Rehn, Yves Robert