Sciweavers

4966 search results - page 209 / 994
» its 2010
Sort
View
MP
2010
128views more  MP 2010»
15 years 5 months ago
Copositivity cuts for improving SDP bounds on the clique number
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
Immanuel M. Bomze, Florian Frommlet, Marco Locatel...
NECO
2010
97views more  NECO 2010»
15 years 5 months ago
Derivatives of Logarithmic Stationary Distributions for Policy Gradient Reinforcement Learning
Most conventional Policy Gradient Reinforcement Learning (PGRL) algorithms neglect (or do not explicitly make use of) a term in the average reward gradient with respect to the pol...
Tetsuro Morimura, Eiji Uchibe, Junichiro Yoshimoto...
OOPSLA
2010
Springer
15 years 5 months ago
Programming with time: cyber-physical programming with impromptu
The act of computer programming is generally considered to be temporally removed from a computer program’s execution. In this paper we discuss the idea of programming as an acti...
Andrew Sorensen, Henry Gardner
PERCOM
2010
ACM
15 years 5 months ago
Communication architectures and experiences for web-connected physical Smart objects
—We are witnessing a tremendous hype on the Internet of Things paradigm, with not only research projects, but also commercial products claiming to implement its fundamental mecha...
Juan Ignacio Vázquez, Jonathan Ruiz de Gari...
SAS
2010
Springer
139views Formal Methods» more  SAS 2010»
15 years 5 months ago
Interprocedural Analysis with Lazy Propagation
We propose lazy propagation as a technique for flow- and context-sensitive interprocedural analysis of programs with objects and first-class functions where transfer functions ma...
Simon Holm Jensen, Anders Møller, Peter Thi...