3663 search results - page 195 / 733 » Problems in the ontology of computer programs |
198
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
185
click to vote
EOR
2010
15 years 6 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
193
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
224
click to vote
ACSC
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we aim to infer a model of genetic networks from time series data of gene expression profiles by using a new gene expression programming algorithm. Gene expression n...
162
click to vote
ACSC
2003
IEEE
15 years 12 months ago
2003
IEEE
The purpose of this paper is to describe in detail the current development status of the innovative Environment for Learning to Program (ELP) which provides an interactive web-bas...