1154 search results - page 163 / 231 » Mathematizing C concurrency |
ISIPTA
1999
IEEE
14 years 1 months ago
1999
IEEE
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
14 years 1 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
MPC
2010
Springer
14 years 1 months ago
2010
Springer
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
GLOBECOM
2009
IEEE
14 years 29 days ago
2009
IEEE
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...
ISSAC
1995
Springer
14 years 19 days ago
1995
Springer
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...