Sciweavers

8828 search results - page 1185 / 1766
» Formal methods in practice
Sort
View
186
Voted
PST
2008
15 years 8 months ago
Encoding the Program Correctness Proofs as Programs in PCC Technology
One of the key issues with the practical applicability of Proof-Carrying Code (PCC) and its related methods is the difficulty in communicating and storing the proofs which are inh...
Heidar Pirzadeh, Danny Dubé
SBBD
2007
72views Database» more  SBBD 2007»
15 years 8 months ago
Similarity and Analogy over Application Domains
Abstract. Databases, particularly when storing heterogeneous, sparse semistructured data, tend to provide incomplete information and information which is difficult to categorize. T...
Simone Diniz Junqueira Barbosa, Karin Koogan Breit...
190
Voted
UAI
2008
15 years 8 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht
AAAI
2004
15 years 8 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
AAAI
2004
15 years 8 months ago
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
Monaldo Mastrolilli, Luca Maria Gambardella
« Prev « First page 1185 / 1766 Last » Next »