Sciweavers

2801 search results - page 64 / 561
» On the Adequateness of the Connection Method
Sort
View
CICLING
2005
Springer
14 years 2 months ago
A Mapping Between Classifiers and Training Conditions for WSD
This paper studies performance of various classifiers for Word Sense Disambiguation considering different training conditions. Our preliminary results indicate that the number and ...
Aarón Pancardo-Rodríguez, Manuel Mon...
FM
1997
Springer
126views Formal Methods» more  FM 1997»
14 years 1 months ago
Reconciling Real-Time with Asynchronous Message Passing
At rst sight, real-time and asynchronous message passing like in SDL and ROOM seem to be incompatible. Indeed these languages fail to model real-time constraints accurately. In thi...
Manfred Broy, Radu Grosu, Cornel Klein
ICTAI
1994
IEEE
14 years 1 months ago
Iterative Strengthening: An Algorithm for Generating Anytime Optimal Plans
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
Randall J. Calistri-Yeh
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
14 years 20 days ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu
CG
2008
Springer
13 years 11 months ago
Parallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...