3122 search results - page 177 / 625 » A Theory of Network Equivalence |
164
click to vote
SAGT
2009
Springer
16 years 1 months ago
2009
Springer
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
154
click to vote
LICS
2007
IEEE
16 years 23 days ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
186
click to vote
MFCS
2007
Springer
16 years 19 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
161
click to vote
PPDP
2007
Springer
16 years 18 days ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
150
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
We present a computation-centric theory of memory models. Unlike traditional processor-centric models, computation-centric models focus on the logical dependencies among instructi...