2989 search results - page 495 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
IDEAS
1999
IEEE
15 years 2 months ago
1999
IEEE
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
CP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
As agent systems are solving more and more complex tasks in increasingly challenging domains, the systems themselves are becoming more complex too, often compromising their adapti...
SIGGRAPH
1991
ACM
15 years 1 months ago
1991
ACM
A major problem challenging opera designers is the inability to coordinate lighting, projection systems, and set designs in the preliminary planning phase. New computer graphics t...