Sciweavers

15485 search results - page 248 / 3097
» Computing Optimal Subsets
Sort
View
CCGRID
2001
IEEE
15 years 10 months ago
A DSM Cluster Architecture Supporting Aggressive Computation in Active Networks
Active networks allow computations to be performed innetwork at routers as messages pass through them. Active networks offer unique opportunities to optimize networkcentric applic...
Peter C. J. Graham
IPPS
2009
IEEE
16 years 1 months ago
Parallel solvers for dense linear systems for heterogeneous computational clusters
This paper describes the design and the implementation of parallel routines in the Heterogeneous ScaLAPACK library that solve a dense system of linear equations. This library is w...
Ravi Reddy Manumachu, Alexey L. Lastovetsky, Pedro...
IPPS
2003
IEEE
15 years 11 months ago
Recovery Schemes for High Availability and High Performance Distributed Real-Time Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing, and are thus attractive in real-time applications. When all computers are up and ...
Lars Lundberg, Daniel Häggander, Kamilla Klon...
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
EH
2005
IEEE
119views Hardware» more  EH 2005»
16 years 4 days ago
Evolutionary Computation Technologies for the Automated Design of Space Systems
The Evolvable Computation Group, at NASA’s Jet Propulsion Laboratory, is tasked with demonstrating the utility of computational engineering and computer optimized design for com...
Richard Terrile, Hrand Aghazarian, Michael I. Ferg...