Sciweavers

660 search results - page 109 / 132
» Hybrid CSP Solving
Sort
View
IPPS
1997
IEEE
14 years 2 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
ATAL
2006
Springer
14 years 1 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
CG
2005
Springer
13 years 10 months ago
Sketch-based free-form shape modelling with a fast and stable numerical engine
In this paper, we present a feature-based free-form shape modelling technique based on solving a fundamental problem of reconstructing the depth information from 2D sketch planes....
Yong-Jin Liu, Kai Tang, Ajay Joneja
ICPP
2009
IEEE
14 years 4 months ago
LeWI: A Runtime Balancing Algorithm for Nested Parallelism
Abstract—We present LeWI: a novel load balancing algorithm, that can balance applications with very different patterns of imbalance. Our algorithm can balance fine grain imbalan...
Marta Garcia, Julita Corbalán, Jesús...
SENSYS
2006
ACM
14 years 4 months ago
Funneling-MAC: a localized, sink-oriented MAC for boosting fidelity in sensor networks
Sensor networks exhibit a unique funneling effect which is a product of the distinctive many-to-one, hop-by-hop traffic pattern found in sensor networks, and results in a signific...
Gahng-Seop Ahn, Se Gi Hong, Emiliano Miluzzo, Andr...