Sciweavers

5499 search results - page 338 / 1100
» Generalized Rewrite Theories
Sort
View
ATAL
2006
Springer
15 years 11 months ago
Monotonic concession protocols for multilateral negotiation
The most natural way of thinking about negotiation is probably a situation whereby each of the parties involved initially make a proposal that is particularly beneficial to themse...
Ulle Endriss
ATAL
2006
Springer
15 years 11 months ago
Agent interaction in distributed POMDPs and its implications on complexity
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...
Jiaying Shen, Raphen Becker, Victor R. Lesser
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 11 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
LICS
1998
IEEE
15 years 11 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
207
Voted
CCS
2008
ACM
15 years 9 months ago
Revocation games in ephemeral networks
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
Maxim Raya, Mohammad Hossein Manshaei, Márk...