Sciweavers

3221 search results - page 191 / 645
» Termination of Linear Programs
Sort
View
240
Voted
CEC
2011
IEEE
14 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
168
Voted
CAV
2003
Springer
108views Hardware» more  CAV 2003»
16 years 8 days ago
Linear Invariant Generation Using Non-linear Constraint Solving
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
Michael Colón, Sriram Sankaranarayanan, Hen...
140
Voted
CMPB
2002
90views more  CMPB 2002»
15 years 6 months ago
Bivariate linear mixed models using SAS proc MIXED
Bivariate linear mixed models are useful when analyzing longitudinal data of two associated markers. In this paper, we present a bivariate linear mixed model including random effe...
Rodolphe Thiébaut, Hélène Jac...
332
Voted
POPL
2009
ACM
16 years 7 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...
165
Voted
ICIP
2003
IEEE
16 years 8 months ago
Linear approximations for rate control in video coding
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
Yegnaswamy Sermadevi, Sheila S. Hemami