Sciweavers

1406 search results - page 279 / 282
» Similarity in Programs
Sort
View
CORR
2010
Springer
158views Education» more  CORR 2010»
14 years 6 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
14 years 4 months ago
A distributed Newton method for Network Utility Maximization
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
Ermin Wei, Asuman E. Ozdaglar, Ali Jadbabaie
JMLR
2010
148views more  JMLR 2010»
14 years 4 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
NHM
2010
87views more  NHM 2010»
14 years 4 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
TDSC
2010
119views more  TDSC 2010»
14 years 4 months ago
On the General Applicability of Instruction-Set Randomization
We describe Instruction-Set Randomization (ISR), a general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoffs' principle to creat...
Stephen W. Boyd, Gaurav S. Kc, Michael E. Locasto,...