Sciweavers

3221 search results - page 226 / 645
» Termination of Linear Programs
Sort
View
CVPR
2012
IEEE
13 years 8 months ago
Sum-product networks for modeling activities with stochastic structure
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
Mohamed R. Amer, Sinisa Todorovic
SEAL
1998
Springer
15 years 10 months ago
Genetic Programming with Active Data Selection
Genetic programming evolves Lisp-like programs rather than fixed size linear strings. This representational power combined with generality makes genetic programming an interesting ...
Byoung-Tak Zhang, Dong-Yeon Cho
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 6 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
EOR
2006
65views more  EOR 2006»
15 years 6 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
15 years 4 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein