Sciweavers

3818 search results - page 664 / 764
» Learning from Order Examples
Sort
View
LPNMR
1990
Springer
15 years 10 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
ECAI
2006
Springer
15 years 10 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu
DLOG
2003
15 years 7 months ago
Incremental Query Answering for Implementing Document Retrieval Services
Agent systems that search the Semantic Web are seen as killer applications for description logic (DL) inference engines. The guiding examples for the Semantic Web involve informat...
Volker Haarslev, Ralf Möller
BMCBI
2008
142views more  BMCBI 2008»
15 years 6 months ago
Optimal neighborhood indexing for protein similarity search
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
Pierre Peterlongo, Laurent Noé, Dominique L...
BIBM
2010
IEEE
151views Bioinformatics» more  BIBM 2010»
15 years 4 months ago
Probabilistic topic modeling for genomic data interpretation
Recently, the concept of a species containing both core and distributed genes, known as the supra- or pangenome theory, has been introduced. In this paper, we aim to develop a new ...
Xin Chen, Xiaohua Hu, Xiajiong Shen, Gail Rosen