Sciweavers

2233 search results - page 1 / 447
» On the Complexity of Theory Curbing
Sort
View
LPAR
2000
Springer
13 years 8 months ago
On the Complexity of Theory Curbing
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
Thomas Eiter, Georg Gottlob
AAAI
2006
13 years 6 months ago
Algorithms for Rationalizability and CURB Sets
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
Michael Benisch, George B. Davis, Tuomas Sandholm
JAIR
2010
153views more  JAIR 2010»
13 years 3 months ago
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
Michael Benisch, George B. Davis, Tuomas Sandholm
JOT
2006
145views more  JOT 2006»
13 years 4 months ago
On Assuring Software Quality and Curbing Software Development Cost
Software quality and software development productivity have been topics of major interest and concern for the past three decades. The recent rapid growth in the size and complexit...
Won Kim
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
13 years 11 months ago
Lane boundary and curb estimation with lateral uncertainties
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
Albert S. Huang, Seth J. Teller