Sciweavers

5904 search results - page 1107 / 1181
» Requirements for a Composition Language
Sort
View
VLDB
1998
ACM
110views Database» more  VLDB 1998»
14 years 1 months ago
Massive Stochastic Testing of SQL
Deterministic testing of SQL database systems is human intensive and cannot adequately cover the SQL input domain. A system (RAGS), was built to stochastically generate valid SQL ...
Donald R. Slutz
AGENTS
1997
Springer
14 years 1 months ago
A Scalable Comparison-Shopping Agent for the World-Wide Web
The World-Wide-Web is less agent-friendly than we might hope. Most information on the Web is presented in loosely structured natural language text with no agent-readable semantics...
Robert B. Doorenbos, Oren Etzioni, Daniel S. Weld
CIKM
1993
Springer
14 years 1 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
EKAW
1992
Springer
14 years 1 months ago
eQuality: An Application of DDucks to Process Management
Process management is a method for improving Boeing's business processes, however many aspects have been difficult to implement. eQuality is a software system based on a frame...
Jeffrey Bradshaw, Peter Holm, Oscar Kipersztok, Th...
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 1 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
« Prev « First page 1107 / 1181 Last » Next »