Sciweavers

1310 search results - page 237 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
PODC
2003
ACM
14 years 1 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
14 years 1 months ago
Fitting multi-planet transit models to photometric time-data series by evolution strategies
In this paper we present the application of an evolution strategy to the problem of detecting multi-planet transit events in photometric time-data series. Planetary transits occur...
Andreas M. Chwatal, Günther R. Raidl, Michael...
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
14 years 21 days ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
CDES
2008
123views Hardware» more  CDES 2008»
13 years 10 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...