1686 search results - page 142 / 338 » Programs as polygraphs: computability and complexity |
128
click to vote
ISORC
2009
IEEE
15 years 10 months ago
2009
IEEE
Complex real-time embedded systems should be compositional and deterministic in the resource, time, and value domains. Determinism eases the engineering of correct systems and com...
108
Voted
GRID
2004
Springer
15 years 9 months ago
2004
Springer
The Web Services Resource Framework (WSRF) and its companion WS-Notification were introduced in January 2004 as a new model on which to build Grids. This paper contains early obse...
116
Voted
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
114
Voted
SAS
2001
Springer
15 years 8 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
115
Voted
MP
2008
15 years 3 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...