Sciweavers

2957 search results - page 126 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
139
Voted
AIPS
2007
15 years 5 months ago
On the Hardness of Planning Problems with Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
15 years 5 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
121
Voted
IJCAI
2007
15 years 4 months ago
Argumentation Based Contract Monitoring in Uncertain Domains
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
Nir Oren, Timothy J. Norman, Alun D. Preece
105
Voted
ISTA
2007
15 years 4 months ago
Game Theory-based Data Mining Technique for Strategy Making of a Soccer Simulation Coach Agent
: Soccer simulation is an effort to motivate researchers to perform artificial and robotic intelligence investigations in a multi-agent system framework. In this paper, we propose ...
Amin Milani Fard, Vahid Salmani, Mahmoud Naghibzad...
IJCAI
2001
15 years 4 months ago
Market Clearability
Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly clea...
Tuomas Sandholm, Subhash Suri