Sciweavers

449 search results - page 85 / 90
» Cooperative Boolean games
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 11 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
AI
2008
Springer
13 years 7 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
AI
2002
Springer
13 years 7 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
IJDSN
2006
132views more  IJDSN 2006»
13 years 7 months ago
Using Misbehavior to Analyze Strategic versus Aggregate Energy Minimization in Wireless Sensor Networks
Abstract-- We present a novel formulation of the problem of energy misbehavior and develop an analytical framework for quantifying its impact on other nodes. Specifically, we formu...
Rajgopal Kannan, Shuangqing Wei, Vasu Chakravarthy...
INTETAIN
2005
Springer
14 years 1 months ago
COMPASS2008: The Smart Dining Service
The Compass20083 project is a sino-german cooperation, aiming at integrating advanced information technologies to create a hightech information system that helps visitors to access...
Ilhan Aslan, Feiyu Xu, Jörg Steffen, Hans Usz...