3169 search results - page 380 / 634 » Robust Timed Automata |
138
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
199
click to vote
DSN
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider cluster systems with multiple nodes where each server is prone to run tasks at a degraded level of service due to some software or hardware fault. The cluster serves t...
196
click to vote
SGP
2007
15 years 9 months ago
2007
In this paper, we describe a system for the reconstruction of deforming geometry from a time sequence of unstructured, noisy point clouds, as produced by recent real-time range sc...
198
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
212
click to vote
CCGRID
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract--The current trend in high performance computing is to aggregate ever larger numbers of processing and interconnection elements in order to achieve desired levels of compu...