Sciweavers

1382 search results - page 118 / 277
» Formal Analysis of Online Algorithms
Sort
View
COLT
2010
Springer
15 years 4 months ago
Composite Objective Mirror Descent
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
John Duchi, Shai Shalev-Shwartz, Yoram Singer, Amb...
AROBOTS
2006
119views more  AROBOTS 2006»
15 years 6 months ago
A Discussion of Simultaneous Localization and Mapping
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...
Udo Frese
ACSC
2004
IEEE
15 years 10 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
RR
2009
Springer
15 years 10 months ago
Search for More Declarativity
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
Simon Brodt, François Bry, Norbert Eisinger
ICMCS
2005
IEEE
158views Multimedia» more  ICMCS 2005»
15 years 11 months ago
Processor Load Analysis for Mobile Multimedia Streaming: The Implication of Power Reduction
The software codec on mobile device introduces significant power consumption because the energy efficiency of general processor based system is much lower than that of the dedicat...
Min Li, Xiaobo Wu, Zihua Guo, Richard Yao, Xiaolan...