Sciweavers

678 search results - page 135 / 136
» A simple typed intermediate language for object-oriented lan...
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 9 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
CORR
2008
Springer
185views Education» more  CORR 2008»
13 years 5 months ago
Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
Yong Zhao, Ioan Raicu, Ian T. Foster, Mihael Hateg...
INFORMS
1998
142views more  INFORMS 1998»
13 years 5 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol
LICS
2010
IEEE
13 years 4 months ago
Polarity and the Logic of Delimited Continuations
Abstract—Polarized logic is the logic of values and continuations, and their interaction through continuation-passing style. The main limitations of this logic are the limitation...
Noam Zeilberger
WCRE
2009
IEEE
14 years 8 days ago
FAMOOSr 2009 - Workshop on FAMIX and Moose in Software Reengineering
The increasing amount of data available about software systems poses new challenges for re- and reverse engineering research, as the proposed approaches need to scale. In this con...
Simon Denier, Tudor Gîrba