Sciweavers

2636 search results - page 117 / 528
» Linear Programming
Sort
View
POPL
2009
ACM
15 years 10 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
ORL
2008
111views more  ORL 2008»
14 years 10 months ago
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel
EUROGP
2001
Springer
15 years 2 months ago
Exact Schema Theorems for GP with One-Point and Standard Crossover Operating on Linear Structures and Their Application to the S
In this paper, firstly we specialise the exact GP schema theorem for one-point crossover to the case of linear structures of variable length, for example binary strings or program...
Riccardo Poli, Nicholas Freitag McPhee
ICFP
2010
ACM
14 years 11 months ago
Higher-order representation of substructural logics
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...
Karl Crary
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Human Posture Recognition with Convex Programming
We present a novel human posture recognition method using convex programming based matching schemes. Instead of trying to segment the object from the background, we develop a nove...
Hao Jiang, Ze-Nian Li, Mark S. Drew