Sciweavers

1477 search results - page 135 / 296
» Random Convex Programs
Sort
View
SIAMJO
2008
100views more  SIAMJO 2008»
13 years 8 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
OL
2011
332views Neural Networks» more  OL 2011»
13 years 3 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski
ICLP
2009
Springer
14 years 9 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
14 years 2 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon