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 ...
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...
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...
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...
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...