Sciweavers

3238 search results - page 128 / 648
» On the Computational Interpretation of Negation
Sort
View
CIE
2007
Springer
16 years 19 days ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
16 years 12 days ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
IJIT
2004
15 years 7 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
AAAI
2010
15 years 6 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
ADS
2004
Springer
15 years 12 months ago
Affective Advice Giving Dialogs
In affective dialog simulation, recognition and interpretation of the affective state of the user should be integrated with display of empathy by the system and with dialog plannin...
Addolorata Cavalluzzi, Valeria Carofiglio, Fiorell...