Sciweavers

1058 search results - page 52 / 212
» It's Doomed; We Can Prove It
Sort
View
LATA
2009
Springer
14 years 2 months ago
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
Dana Pardubská, Martin Plátek, Fried...
CAEPIA
2007
Springer
14 years 1 months ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson
ENTCS
2007
107views more  ENTCS 2007»
13 years 10 months ago
Formal Translation of Bytecode into BoogiePL
Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...
Hermann Lehner, Peter Müller
AAMAS
2007
Springer
13 years 10 months ago
Reaching pareto-optimality in prisoner's dilemma using conditional joint action learning
We consider a repeated Prisoner’s Dilemma game where two independent learning agents play against each other. We assume that the players can observe each others’ action but ar...
Dipyaman Banerjee, Sandip Sen
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Soft Control on Collective Behavior of a Group of Autonomous Agents by a Shill Agent
This paper asks a new question: how can we control the collective behavior of self-organized multi-agent systems? We try to answer the question by proposing a new notion called `So...
Jing Han, Ming Li, Lei Guo