Sciweavers

AAAI
2008
13 years 7 months ago
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
Yong Gao
AAAI
2008
13 years 7 months ago
Bayes-Relational Learning of Opponent Models from Incomplete Information in No-Limit Poker
We propose an opponent modeling approach for no-limit Texas hold-em poker that starts from a (learned) prior, i.e., general expectations about opponent behavior and learns a relat...
Marc J. V. Ponsen, Jan Ramon, Tom Croonenborghs, K...
AAAI
2008
13 years 7 months ago
The Parameterized Complexity of Global Constraints
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
AAAI
2008
13 years 7 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
AAAI
2008
13 years 7 months ago
Learning to Improve Earth Observation Flight Planning
This paper describes a method and system for integrating machine learning with planning and data visualization for the management of mobile sensors for Earth science investigation...
Robert A. Morris, Nikunj C. Oza, Leslie Keely, Eli...
AAAI
2008
13 years 7 months ago
The Swarm Application Framework
The Swarm Application Framework (SAF) is a tool that makes the development of swarm applications more intuitive. Traditionally, swarm applications are created by programming sever...
Don Miner, Marie desJardins, Peter Hamilton
AAAI
2008
13 years 7 months ago
New Compilation Languages Based on Structured Decomposability
We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to repr...
Knot Pipatsrisawat, Adnan Darwiche
AAAI
2008
13 years 7 months ago
Parallel Belief Revision
A recalcitrant problem in approaches to iterated belief revision is that, after first revising by a formula and then by a formula that is inconsistent with the first formula, all ...
James P. Delgrande, Yi Jin
AAAI
2008
13 years 7 months ago
On the Decidability of Role Mappings between Modular Ontologies
Many semantic web applications require support for mappings between roles (or properties) defined in multiple independently developed ontology modules. Distributed Description Log...
Jie Bao, George Voutsadakis, Giora Slutzki, Vasant...