Sciweavers

2636 search results - page 95 / 528
» Linear Programming
Sort
View
MP
2010
97views more  MP 2010»
14 years 4 months ago
Semidefinite representation of convex sets
Let S = {x Rn : g1(x) 0,
J. William Helton, Jiawang Nie
FMCAD
2009
Springer
15 years 4 months ago
Decision diagrams for linear arithmetic
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
Sagar Chaki, Arie Gurfinkel, Ofer Strichman
ISSAC
1993
Springer
119views Mathematics» more  ISSAC 1993»
15 years 2 months ago
Finding all Hypergeometric Solutions of Linear Differential Equations
Hypergeometric sequences are such that the quotient of two successive terms is a fixed rational function of the index. We give a generalization of M. Petkov6ek’s algorithm to fi...
Marko Petkovsek, Bruno Salvy
AAAI
2006
14 years 11 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
TIT
2010
160views Education» more  TIT 2010»
14 years 4 months ago
Bounds on the rate of 2-D bit-stuffing encoders
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasistati...
Ido Tal, Ron M. Roth