Sciweavers

227 search results - page 12 / 46
» A Competitive Algorithm for the General 2-Server Problem
Sort
View
IJCAI
2003
13 years 9 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus
TNN
1998
76views more  TNN 1998»
13 years 8 months ago
Multiobjective genetic algorithm partitioning for hierarchical learning of high-dimensional pattern spaces: a learning-follows-d
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
Rajeev Kumar, Peter Rockett
ATAL
2010
Springer
13 years 9 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
FCT
2009
Springer
14 years 3 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
ECAI
2000
Springer
14 years 24 days ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta