Sciweavers

823 search results - page 92 / 165
» Stateful Subset Cover
Sort
View
CAV
2006
Springer
133views Hardware» more  CAV 2006»
14 years 1 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
ERSHOV
2006
Springer
14 years 1 months ago
Chase of Recursive Queries
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries. Using datalog notation, we c...
Nieves R. Brisaboa, Antonio Fariña, Miguel ...
FLAIRS
2008
14 years 10 days ago
Win, Lose, or Get Out the Way - Eliminating Unnecessary Evaluation in Game Search
In this paper we present our approach of improving the traditional alpha-beta search process for strategic board games by modifying the method in two ways: 1) forgoing the evaluat...
Hsiu-Chin Lin, Colleen van Lent
GVD
2004
111views Database» more  GVD 2004»
13 years 11 months ago
Detecting Logical Errors in SQL Queries
Abstract. Checking the consistency of query conditions is an old problem, and there are already many proposed solutions. Since the problem is in general undecidable, there is not a...
Stefan Brass, Christian Goldberg
AIPS
1994
13 years 11 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald