Sciweavers

587 search results - page 29 / 118
» Mathematical Analysis of Multi-Agent Systems
Sort
View
FOSSACS
2008
Springer
13 years 9 months ago
Robust Analysis of Timed Automata via Channel Machines
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reyn...
ISSAC
1989
Springer
74views Mathematics» more  ISSAC 1989»
13 years 11 months ago
Lookup Tables, Recurrences and Complexity
The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by...
Richard J. Fateman
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
13 years 11 months ago
On Randomized Lanczos Algorithms
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
Wayne Eberly, Erich Kaltofen
CC
2004
Springer
142views System Software» more  CC 2004»
14 years 24 days ago
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...
Philippe Clauss, Irina Tchoupaeva
RTSS
2002
IEEE
14 years 9 days ago
Analysis of a Reservation-Based Feedback Scheduler
When executing soft real-time tasks in a shared processor, it is important to properly allocate the computational resources such that the quality of service requirements of each t...
Luca Abeni, Luigi Palopoli, Giuseppe Lipari, Jonat...