Sciweavers

8825 search results - page 1675 / 1765
» All for one or one for all
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 2 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
KR
1992
Springer
14 years 2 months ago
Embedding Defaults into Terminological Knowledge Representation Formalisms
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
Franz Baader, Bernhard Hollunder
STACS
1992
Springer
14 years 2 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
POPL
1989
ACM
14 years 2 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
VLDB
1990
ACM
128views Database» more  VLDB 1990»
14 years 2 months ago
Advanced Query Processing in Object Bases Using Access Support Relations
Even though the large body of knowledge of relational query optimization techniques can be utilized as a starting point for object-oriented query optimization the full exploitatio...
Alfons Kemper, Guido Moerkotte
« Prev « First page 1675 / 1765 Last » Next »