3179 search results - page 274 / 636 » Applications of PCF Theory |
80
Voted
LICS
2007
IEEE
15 years 7 months 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...
86
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
94
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
81
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Ontology matching is currently a key technology to achieve the semantic alignment of ontological entities used by knowledge-based applications, and therefore to enable their inter...
102
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...