Sciweavers

4781 search results - page 706 / 957
» Complexity at large
Sort
View
87
Voted
ENTCS
2008
95views more  ENTCS 2008»
15 years 25 days ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
107
Voted
EOR
2008
110views more  EOR 2008»
15 years 25 days ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
98
Voted
FGCS
2008
102views more  FGCS 2008»
15 years 24 days ago
Making the best of a bad situation: Prioritized storage management in GEMS
As distributed storage systems grow, the response time between detection and repair of the error becomes significant. Systems built on shared servers have additional complexity be...
Justin M. Wozniak, Paul Brenner, Douglas Thain, Aa...
124
Voted
FGCS
2008
127views more  FGCS 2008»
15 years 24 days ago
Monte Carlo methods for matrix computations on the grid
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
Simon Branford, Cihan Sahin, Ashish Thandavan, Chr...
FOCM
2008
100views more  FOCM 2008»
15 years 24 days ago
Meshfree Thinning of 3D Point Clouds
An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point remov...
Nira Dyn, Armin Iske, Holger Wendland