Sciweavers

2150 search results - page 384 / 430
» Programming Models for Grid Applications and Systems: Requir...
Sort
View
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
13 years 7 months ago
Squaring the circle: An algorithm for generating polyhedral invariant sets from ellipsoidal ones
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
A. Alessio, Mircea Lazar, Alberto Bemporad, W. P. ...
OOPSLA
2010
Springer
13 years 6 months ago
Instrumentation and sampling strategies for cooperative concurrency bug isolation
Fixing concurrency bugs (or crugs) is critical in modern software systems. Static analyses to find crugs such as data races and atomicity violations scale poorly, while dynamic a...
Guoliang Jin, Aditya V. Thakur, Ben Liblit, Shan L...
DAC
2002
ACM
14 years 8 months ago
A universal technique for fast and flexible instruction-set architecture simulation
In the last decade, instruction-set simulators have become an essential development tool for the design of new programmable architectures. Consequently, the simulator performance ...
Achim Nohl, Gunnar Braun, Oliver Schliebusch, Rain...
ERCIMDL
2007
Springer
159views Education» more  ERCIMDL 2007»
14 years 1 months ago
Reducing Costs for Digitising Early Music with Dynamic Adaptation
Abstract. Optical music recognition (OMR) enables librarians to digitise early music sources on a large scale. The cost of expert human labour to correct automatic recognition erro...
Laurent Pugin, John Ashley Burgoyne, Ichiro Fujina...
CCE
2004
13 years 7 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...