6105 search results - page 897 / 1221 » A Parallel Algorithm for Bound-Smoothing |
176
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
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...
160
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Trust management, broadly intended as the ability to maintain belief relationship among entities, is recognized as a fundamental security challenge for autonomous and selforgan...
166
click to vote
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
160
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
Paper architectures are 3D paper buildings created by folding and cutting. The creation process of paper architecture is often laborintensive and highly skill-demanding, even with...
154
click to vote
ISCA
2000
IEEE
15 years 11 months ago
2000
IEEE
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...