Sciweavers

175 search results - page 25 / 35
» Forgetting Reinforced Cases
Sort
View
ICSE
2010
IEEE-ACM
14 years 8 days ago
Using twinning to adapt programs to alternative APIs
We describe twinning and its applications to adapting programs to alternative APIs. Twinning is a simple technique that allows programmers to specify a class of program changes, i...
Marius Nita, David Notkin
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 11 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...
STACS
1992
Springer
13 years 11 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...
FLAIRS
2007
13 years 9 months ago
Compositional Belief Update
In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to pro...
James P. Delgrande, Francis Jeffry Pelletier, Matt...
COMCOM
2010
133views more  COMCOM 2010»
13 years 7 months ago
Measuring long-term location privacy in vehicular communication systems
Vehicular communication systems are an emerging form of communication that enables new ways of cooperation among vehicles, traffic operators, and service providers. However, many ...
Zhendong Ma, Frank Kargl, Michael Weber