Sciweavers

1920 search results - page 152 / 384
» The Complexity of the A B C Problem
Sort
View
IJCAI
1997
15 years 8 months ago
Development of Iterative Real-time Scheduler to Planner Feedback
Planning for real-time applications involves decisions not only about what actions to take in what states to progress toward achieving goals (the traditional decision problem face...
Charles B. McVey, Ella M. Atkins, Edmund H. Durfee...
COLT
2006
Springer
15 years 10 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
POPL
1994
ACM
15 years 10 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
C5
2006
IEEE
16 years 18 days ago
A Buffer Framework for Supporting Responsive Interaction in Information Visualization Interfaces
We present a framework that we are developing to better solve several critical issues that arise when interactive systems are extended to large displays. These issues include slow...
Tobias Isenberg, André Miede, M. Sheelagh T...
FOCS
1993
IEEE
15 years 10 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch