1523 search results - page 133 / 305 » Partially ordered secretaries |
141
Voted
APAL
2011
14 years 7 months ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
142
click to vote
PPOPP
2009
ACM
16 years 1 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
105
Voted
SIGECOM
2010
ACM
15 years 1 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
111
Voted
RTA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
79
Voted
DATE
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper presents the Pareto Calculator, a tool for compositional computation of Pareto points, based on the algebra of Pareto points. The tool is a useful instrument for multidi...