Sciweavers

148 search results - page 21 / 30
» Programming with angelic nondeterminism
Sort
View
JLP
2007
89views more  JLP 2007»
13 years 9 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
HPCA
2008
IEEE
14 years 10 months ago
Supporting highly-decoupled thread-level redundancy for parallel programs
The continued scaling of device dimensions and the operating voltage reduces the critical charge and thus natural noise tolerance level of transistors. As a result, circuits can p...
M. Wasiur Rashid, Michael C. Huang
ICALP
2007
Springer
14 years 4 months ago
Continuous Capacities on Continuous State Spaces
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
Jean Goubault-Larrecq
ADBIS
2010
Springer
181views Database» more  ADBIS 2010»
13 years 11 months ago
Stones Falling in Water: When and How to Restructure a View-Based Relational Database
Nowadays, one of the most important problems of software engineering continues to be the maintenance of both databases and applications. It is clear that any method that can reduce...
Eladio Domínguez, Jorge Lloret, Angel Luis ...
COR
2006
94views more  COR 2006»
13 years 10 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...