402 search results - page 69 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
CACM
1998
13 years 8 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
AIPS
2003
13 years 10 months ago
2003
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
OOPSLA
2007
Springer
14 years 2 months ago
2007
Springer
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
HOTSWUP
2009
ACM
14 years 1 months ago
2009
ACM
The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major s...
POPL
2006
ACM
14 years 9 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...