Sciweavers

2487 search results - page 467 / 498
» Partitions of Graphs into Trees
Sort
View
AAAI
2007
13 years 10 months ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
AAAI
2010
13 years 9 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
LREC
2008
159views Education» more  LREC 2008»
13 years 9 months ago
Corpus Exploitation from Wikipedia for Ontology Construction
Ontology construction usually requires a domain-specific corpus for building corresponding concept hierarchy. The domain corpus must have a good coverage of domain knowledge. Wiki...
Gaoying Cui, Qin Lu, Wenjie Li, Yi-Rong Chen
IJCAI
2007
13 years 9 months ago
Utile Distinctions for Relational Reinforcement Learning
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
William Dabney, Amy McGovern
NIPS
2008
13 years 9 months ago
Learning Bounded Treewidth Bayesian Networks
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
Gal Elidan, Stephen Gould