Sciweavers

2766 search results - page 340 / 554
» Algorithms for trigonometric polynomials
Sort
View
ATAL
2006
Springer
15 years 8 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
EUROCRYPT
2006
Springer
15 years 8 months ago
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
Frederik Armknecht, Claude Carlet, Philippe Gabori...
AAAI
2008
15 years 7 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 6 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
SIROCCO
2004
15 years 6 months ago
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
Deshi Ye, Hu Zhang