Sciweavers

4426 search results - page 321 / 886
» Concurrent Constraint Programming
Sort
View
COR
2011
15 years 1 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck
OL
2011
177views Neural Networks» more  OL 2011»
14 years 9 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
15 years 10 months ago
Finding safety errors with ACO
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
Enrique Alba, J. Francisco Chicano
JPDC
2010
117views more  JPDC 2010»
15 years 5 months ago
Extensible transactional memory testbed
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...
Derin Harmanci, Vincent Gramoli, Pascal Felber, Ch...
PLDI
2012
ACM
13 years 9 months ago
JANUS: exploiting parallelism via hindsight
This paper addresses the problem of reducing unnecessary conflicts in optimistic synchronization. Optimistic synchronization must ensure that any two concurrently executing trans...
Omer Tripp, Roman Manevich, John Field, Mooly Sagi...