Sciweavers

1763 search results - page 280 / 353
» A Formalization of Polytime Functions
Sort
View
LICS
2003
IEEE
15 years 3 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
RSP
2003
IEEE
169views Control Systems» more  RSP 2003»
15 years 3 months ago
Rapid Prototyping and Incremental Evolution Using SLAM
The paper shows the outlines of the SLAM system and how its design is suitable for automating rapid prototyping. The system includes a very expressive object oriented specificati...
Ángel Herranz-Nieva, Juan José Moren...
DEBS
2003
ACM
15 years 3 months ago
Relational subscription middleware for Internet-scale publish-subscribe
We present a design of a distributed publish-subscribe system that extends the functionality of messaging middleware with “relational subscriptions”, to support timely updates...
Yuhui Jin, Robert E. Strom
PLDI
2003
ACM
15 years 3 months ago
A static analyzer for large safety-critical software
d Abstract) Bruno Blanchet∗ § Patrick Cousot§ Radhia Cousot∗¶ J´erˆome Feret§ Laurent Mauborgne§ Antoine Min´e§ David Monniaux∗§ Xavier Rival§ that abstract inter...
Bruno Blanchet, Patrick Cousot, Radhia Cousot, J&e...
ATAL
2003
Springer
15 years 3 months ago
Transition-independent decentralized markov decision processes
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...