Sciweavers

575 search results - page 33 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
EUROCAST
1997
Springer
156views Hardware» more  EUROCAST 1997»
13 years 11 months ago
A Computational Model for Visual Size, Location and Movement
The ability to detect object size, location and movement is essential for a visual system in either a biological or man made environment. In this paper we present a model for esti...
Miguel Alemán-Flores, K. Nicholas Leibovic,...
PACT
2005
Springer
14 years 1 months ago
OpenTS: An Outline of Dynamic Parallelization Approach
The paper is dedicated to an open T-system (OpenTS) — a programming system that supports automatic parallelization of computations for high-performance and distributed applicatio...
Sergey Abramov, Alexey I. Adamovich, Alexander Iny...
ICDCS
2008
IEEE
14 years 2 months ago
Can We Really Recover Data if Storage Subsystem Fails?
This paper presents a theoretical and experimental study on the limitations of copy-on-write snapshots and incremental backups in terms of data recoverability. We provide mathemat...
Weijun Xiao, Qing Yang
IPPS
2005
IEEE
14 years 1 months ago
A Distributed Procedure for Bandwidth-Centric Scheduling of Independent-Task Applications
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
Cyril Banino
ESCIENCE
2006
IEEE
13 years 11 months ago
A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem
In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations ...
Silvio Priem-Mendes, Juan Antonio Gómez Pul...