Sciweavers

271 search results - page 32 / 55
» Distributed Problem Solving In SPite Of Processor Failures
Sort
View
EDOC
2002
IEEE
14 years 1 months ago
Constraint Based Network Adaptation for Ubiquitous Applications
In this paper, we present a constraint-based approach for selecting and deploying active network components, called proxylets, which execute on servers within the network to perfo...
Krish T. Krishnakumar, Morris Sloman
TPDS
2008
175views more  TPDS 2008»
13 years 8 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
IPPS
2008
IEEE
14 years 2 months ago
Parallelized preprocessing algorithms for high-density oligonucleotide arrays
Studies of gene expression using high-density oligonucleotide microarrays have become standard in a variety of biological contexts. The data recorded using the microarray techniqu...
Markus Schmidberger, Ulrich Mansmann
ISORC
2008
IEEE
14 years 2 months ago
Obstacles in Worst-Case Execution Time Analysis
The analysis of the worst-case execution time (WCET) requires detailed knowledge of the program behavior. In practice it is still not possible to obtain all needed information aut...
Raimund Kirner, Peter P. Puschner
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 8 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth