Sciweavers

1064 search results - page 196 / 213
» Disjoint Systems (Extended Abstract)
Sort
View
RANDOM
1998
Springer
15 years 7 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
APLAS
2008
ACM
15 years 5 months ago
Exception Handlers as Extensible Cases
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
Matthias Blume, Umut A. Acar, Wonseok Chae
132
Voted
FASE
2008
Springer
15 years 5 months ago
Consistent Integration of Models Based on Views of Visual Languages
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
Hartmut Ehrig, Karsten Ehrig, Claudia Ermel, Ulrik...
EC
2008
116views ECommerce» more  EC 2008»
15 years 3 months ago
Efficient Evaluation Functions for Evolving Coordination
Abstract-- This paper presents a method for creating evaluation functions that efficiently promote coordination in a multiagent system, allowing single-agent evolutionary computati...
Adrian K. Agogino, Kagan Tumer
JAIR
2008
157views more  JAIR 2008»
15 years 3 months ago
Learning to Reach Agreement in a Continuous Ultimatum Game
It is well-known that acting in an individually rational manner, according to the principles of classical game theory, may lead to sub-optimal solutions in a class of problems nam...
Steven de Jong, Simon Uyttendaele, Karl Tuyls