Sciweavers

1568 search results - page 122 / 314
» The problem of examination questions in algorithmics
Sort
View
IJCAI
2001
15 years 5 months ago
Rational and Convergent Learning in Stochastic Games
This paper investigates the problem of policy learning in multiagent environments using the stochastic game framework, which we briefly overview. We introduce two properties as de...
Michael H. Bowling, Manuela M. Veloso
MTA
2007
101views more  MTA 2007»
15 years 4 months ago
Finding maximum-length repeating patterns in music databases
Abstract This paper introduces the problem of discovering maximum-length repeating patterns in music objects. A novel algorithm is presented for the extraction of this kind of patt...
Ioannis Karydis, Alexandros Nanopoulos, Yannis Man...
ICIP
2001
IEEE
16 years 6 months ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen
CIE
2007
Springer
15 years 10 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
FC
1998
Springer
96views Cryptology» more  FC 1998»
15 years 8 months ago
Compliance Checking in the PolicyMaker Trust Management System
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
Matt Blaze, Joan Feigenbaum, Martin Strauss