Sciweavers

7092 search results - page 229 / 1419
» Parallelizing constraint programs
Sort
View
183
Voted
CP
2009
Springer
16 years 1 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
ICASSP
2011
IEEE
14 years 4 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan
ICLP
2003
Springer
15 years 5 months ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia
102
Voted
HOTDEP
2008
122views Hardware» more  HOTDEP 2008»
15 years 2 months ago
Dependable Self-Hosting Distributed Systems Using Constraints
We describe a technique for writing distributed applications which manage themselves over one or more utility computing infrastructures: by dynamically acquiring new computational...
Qin Yin, Justin Cappos, Andrew Baumann, Timothy Ro...
DATE
2010
IEEE
125views Hardware» more  DATE 2010»
15 years 5 months ago
pSHS: A scalable parallel software implementation of Montgomery multiplication for multicore systems
—Parallel programming techniques have become one of the great challenges in the transition from single-core to multicore architectures. In this paper, we investigate the parallel...
Zhimin Chen, Patrick Schaumont