Sciweavers

383 search results - page 35 / 77
» Optimizing Computing Costs Using Divisible Load Analysis
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 12 days ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
DAC
2003
ACM
14 years 9 months ago
Optimizations for a simulator construction system supporting reusable components
Exploring a large portion of the microprocessor design space requires the rapid development of efficient simulators. While some systems support rapid model development through the...
David A. Penry, David I. August
AAMAS
2010
Springer
13 years 8 months ago
Multi-goal economic search using dynamic search structures
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...
David Sarne, Efrat Manisterski, Sarit Kraus
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
11 years 10 months ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...
BMCBI
2007
166views more  BMCBI 2007»
13 years 8 months ago
Data handling strategies for high throughput pyrosequencers
Background: New high throughput pyrosequencers such as the 454 Life Sciences GS 20 are capable of massively parallelizing DNA sequencing providing an unprecedented rate of output ...
Gabriele A. Trombetti, Raoul J. P. Bonnal, Ermanno...