Sciweavers

832 search results - page 140 / 167
» Parallel algorithms for solving aggregated shortest-path pro...
Sort
View
PODC
2003
ACM
15 years 2 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
86
Voted
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
15 years 2 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...
72
Voted
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 1 months 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»
14 years 11 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...
PASTE
2004
ACM
15 years 3 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick