Sciweavers

1101 search results - page 82 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 1 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
GRID
2000
Springer
15 years 1 months ago
Architectural Models for Resource Management in the Grid
: The concept of coupling geographically distributed (high-end) resources for solving large-scale problems is becoming increasingly popular, forming what is popularly called grid c...
Rajkumar Buyya, Steve J. Chapin, David C. DiNucci
FOCS
2004
IEEE
15 years 1 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
WDAG
2007
Springer
92views Algorithms» more  WDAG 2007»
15 years 3 months ago
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...
Joffroy Beauquier, Julien Clement, Stéphane...
CASES
2009
ACM
15 years 4 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...