Sciweavers

2905 search results - page 331 / 581
» Formal Memetic Algorithms
Sort
View
147
Voted
TABLEAUX
2000
Springer
15 years 7 months ago
A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
Alberto Artosi, Guido Governatori, Antonino Rotolo
139
Voted
ICML
1994
IEEE
15 years 7 months ago
Markov Games as a Framework for Multi-Agent Reinforcement Learning
In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function....
Michael L. Littman
SIGMOD
1991
ACM
110views Database» more  SIGMOD 1991»
15 years 7 months ago
Updating Relational Databases through Object-Based Views
The view-object model provides a formal basis for representing and manipulating object-based views on relational databases. In this paper, we present a scheme for handling update ...
Thierry Barsalou, Arthur M. Keller, Niki Siambela,...
SPDP
1991
IEEE
15 years 7 months ago
Fault-tolerant meshes with minimal numbers of spares
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
Jehoshua Bruck, Robert Cypher, Ching-Tien Ho
130
Voted
ASM
2010
ASM
15 years 7 months ago
A Refinement-Based Correctness Proof of Symmetry Reduced Model Checking
Symmetry reduction is a model checking technique that can help alleviate the problem of state space explosion, by preventing redundant state space exploration. In previous work, we...
Edd Turner, Michael J. Butler, Michael Leuschel