Sciweavers

9626 search results - page 1501 / 1926
» Invariant Based Programming
Sort
View
IQ
2003
15 years 8 months ago
ClueMaker: A Language for Approximate Record Matching
We introduce ClueMaker, the first language designed specifically for approximate record matching. Clues written in ClueMaker predict whether two records denote the same thing based...
Martin Buechi, Andrew Borthwick, Adam Winkel, Arth...
PDPTA
2003
15 years 8 months ago
Distop: A Low-Overhead Cluster Monitoring System
Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-base...
Daniel Andresen, Nathan Schopf, Ethan Bowker, Timo...
SBBD
2003
101views Database» more  SBBD 2003»
15 years 8 months ago
Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
Fabio Porto, Eduardo Sany Laber, Patrick Valduriez
AAAI
1998
15 years 8 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
ACL
1998
15 years 8 months ago
Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for Email
This paper describes a novel method by which a dialogue agent can learn to choose an optimal dialogue strategy. While it is widely agreed that dialogue strategies should be formul...
Marilyn A. Walker, Jeanne Frommer, Shrikanth Naray...
« Prev « First page 1501 / 1926 Last » Next »