2446 search results - page 348 / 490 » Choiceless Polynomial Time |
ECAI
2008
Springer
14 years 12 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
AAAI
2010
14 years 11 months ago
2010
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u ca...
AAAI
2010
14 years 11 months ago
2010
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
70
Voted
AMW
2010
14 years 11 months ago
2010
Abstract. We study the problem of instance level (ABox) updates for Knowledge Bases (KBs) represented in Description Logics of the DL-Lite family. DLLite is at the basis of OWL 2 Q...
CCCG
2010
14 years 11 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...