Sciweavers

583 search results - page 34 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
IMR
2004
Springer
15 years 3 months ago
Efficient Spacetime Meshing with Nonlocal Cone Constraints
Spacetime Discontinuous Galerkin (DG) methods are used to solve hyperbolic PDEs describing wavelike physical phenomena. When the PDEs are nonlinear, the speed of propagation of th...
Shripad Thite
FLAIRS
2004
14 years 11 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
CP
2009
Springer
15 years 10 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
HPCC
2010
Springer
14 years 10 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
ADHOC
2005
116views more  ADHOC 2005»
14 years 9 months ago
Power efficient routing trees for ad hoc wireless networks using directional antenna
In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed t...
Fei Dai, Qing Dai, Jie Wu