21108 search results - page 96 / 4222 » A General Class of Models of |
114
Voted
CSL
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
129
Voted
DEDS
1998
15 years 3 months ago
1998
In this paper, we study the control of Composite Hybrid Machines (CHMs) subject to safety speci cations. CHMs are a fairly general class of hybrid systems modeled in modular fashi...
141
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
129
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
144
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...