Sciweavers

773 search results - page 130 / 155
» Efficient system design space exploration using machine lear...
Sort
View
AAAI
1994
14 years 11 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
P2P
2008
IEEE
137views Communications» more  P2P 2008»
15 years 4 months ago
Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems
Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and...
Alessandro Duminuco, Ernst Biersack
ATAL
2006
Springer
15 years 1 months ago
Evolutionary Optimization of ZIP60: A Controlled Explosion in Hyperspace
The "ZIP" adaptive trading algorithm has been demonstrated to outperform human traders in experimental studies of continuous double auction (CDA) markets. The original Z...
Dave Cliff
SIGMETRICS
2004
ACM
15 years 3 months ago
Storage device performance prediction with CART models
d Abstract] Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anthony Brockwell, Christos Faloutsos, and Gregory R. Ganger Carnegie Mellon University This work explores the applicatio...
Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anth...
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
14 years 7 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang