Sciweavers

7092 search results - page 278 / 1419
» Parallelizing constraint programs
Sort
View
RV
2010
Springer
152views Hardware» more  RV 2010»
15 years 8 days ago
Efficient Data Race Detection for Async-Finish Parallelism
One of the major productivity hurdles for parallel programming is non-determinism -- a parallel program may yield different results on different executions with the same input, dep...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
4OR
2004
90views more  4OR 2004»
15 years 2 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano
CISIS
2008
IEEE
15 years 9 months ago
Java and the Power of Multi-Core Processing
The new era of multi-core processing challenges software designers to efficiently exploit the parallelism that is now massively available. Programmers have to exchange the conven...
Peter Bertels, Dirk Stroobandt
CP
2008
Springer
15 years 4 months ago
Solving a Telecommunications Feature Subscription Configuration Problem
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
MP
2008
117views more  MP 2008»
15 years 2 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph