Sciweavers

1481 search results - page 145 / 297
» Optimal Reductions in Interaction Systems
Sort
View
IPPS
2007
IEEE
15 years 5 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad
FCCM
1999
IEEE
210views VLSI» more  FCCM 1999»
15 years 3 months ago
Algorithm Analysis and Mapping Environment for Adaptive Computing Systems: Further Results
Abstract We are developing an integrated algorithm analysis and mapping environment particularly tailored for signal processing applications on Adaptive Computing Systems ACS. Our ...
Eric K. Pauer, Paul D. Fiore, John M. Smith
CGO
2003
IEEE
15 years 4 months ago
Compiler Optimization-Space Exploration
To meet the performance demands of modern architectures, compilers incorporate an everincreasing number of aggressive code transformations. Since most of these transformations are...
Spyridon Triantafyllis, Manish Vachharajani, Neil ...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 10 days ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
CGO
2009
IEEE
15 years 6 months ago
Reducing Memory Ordering Overheads in Software Transactional Memory
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
Michael F. Spear, Maged M. Michael, Michael L. Sco...