Sciweavers

2609 search results - page 84 / 522
» Optimizing for parallelism and data locality
Sort
View
CP
2006
Springer
15 years 8 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
DCOSS
2006
Springer
15 years 8 months ago
Evaluating Local Contributions to Global Performance in Wireless Sensor and Actuator Networks
Wireless sensor networks are often studied with the goal of removing information from the network as efficiently as possible. However, when the application also includes an actuato...
Christopher J. Rozell, Don H. Johnson
125
Voted
CEC
2010
IEEE
15 years 4 months ago
Parallel hybrid evolutionary algorithms on GPU
Abstract— Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of methods such as evolutionary algorithms and...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
EDBT
2008
ACM
85views Database» more  EDBT 2008»
16 years 4 months ago
Optimizing on-demand data broadcast scheduling in pervasive environments
Data dissemination in pervasive environments is often accomplished by on-demand broadcasting. The time critical nature of the data requests plays an important role in scheduling t...
Rinku Dewri, Indrakshi Ray, Indrajit Ray, Darrell ...
130
Voted
DAWAK
2005
Springer
15 years 10 months ago
Gene Expression Biclustering Using Random Walk Strategies
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
Fabrizio Angiulli, Clara Pizzuti