Sciweavers

3172 search results - page 122 / 635
» New developments of the Z-EDM algorithm
Sort
View
AAAI
2007
15 years 6 months ago
Propagating Knapsack Constraints in Sublinear Time
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal ...
NIPS
2004
15 years 5 months ago
Brain Inspired Reinforcement Learning
Successful application of reinforcement learning algorithms often involves considerable hand-crafting of the necessary non-linear features to reduce the complexity of the value fu...
François Rivest, Yoshua Bengio, John Kalask...
RTS
2010
175views more  RTS 2010»
14 years 10 months ago
Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities
Safety-critical real-time standards define several criticality levels for the tasks (e.g., DO-178B - Software Considerations in Airborne Systems and Equipment Certification). Clas...
François Dorin, Pascal Richard, Michaë...
BMCBI
2008
84views more  BMCBI 2008»
15 years 4 months ago
The comparative analysis of statistics, based on the likelihood ratio criterion, in the automated annotation problem
Background: This paper discusses the problem of automated annotation. It is a continuation of the previous work on the A4-algorithm (Adaptive algorithm of automated annotation) de...
Andrey M. Leontovich, Konstantin Y. Tokmachev, Han...
GIAE
2004
Springer
159views Mathematics» more  GIAE 2004»
15 years 9 months ago
A Survey of Moving Frames
This paper surveys the new, algorithmic theory of moving frames developed by the author and M. Fels. Applications in geometry, computer vision, classical invariant theory, the cal...
Peter J. Olver