Sciweavers

585 search results - page 46 / 117
» Strategy Logic
Sort
View
101
Voted
CONCUR
2007
Springer
15 years 8 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
113
Voted
AIEDU
2007
108views more  AIEDU 2007»
15 years 2 months ago
Explicit Reflection in Prolog-Tutor
This paper describes a reflection-based approach for open learner modeling (OLM). Tutoring dialogues are used by learners to explicitly reveal their own knowledge state to themselv...
Joséphine M. P. Tchétagni, Roger Nka...
98
Voted
FUZZIEEE
2007
IEEE
15 years 9 months ago
On Using Fuzzy Contact Maps for Protein Structure Comparison
The comparison of protein structures is an important problem in Bioinformatics, and Soft Computing techniques were recently introduced for achieving a better representation and po...
Juan Ramón González, David A. Pelta
237
Voted
CADE
2007
Springer
16 years 2 months ago
Combining Deduction and Algebraic Constraints for Hybrid System Analysis
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
André Platzer
140
Voted
HEURISTICS
2002
99views more  HEURISTICS 2002»
15 years 2 months ago
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...