Sciweavers

402 search results - page 23 / 81
» Complexity of Decision Problems for Simple Regular Expressio...
Sort
View
AI
2000
Springer
14 years 1 months ago
Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasin...
Qiang Yang, Jing Wu
WEBDB
2004
Springer
80views Database» more  WEBDB 2004»
14 years 2 months ago
Unraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation
We consider the scenario where existing relational data is exported as XML. In this context, we look at the problem of translating XML queries into SQL. XML query languages have t...
Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F...
PODC
1999
ACM
14 years 1 months ago
Optimal, Distributed Decision-Making: The Case of no Communication
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Marios Mavronicolas, Paul G. Spirakis
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
JAIR
2000
152views more  JAIR 2000»
13 years 8 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht