Sciweavers

7092 search results - page 244 / 1419
» Parallelizing constraint programs
Sort
View
IJCAI
2003
15 years 1 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
95
Voted
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
15 years 6 months ago
Sub-operation parallelism optimization in SIMD processor synthesis and its experimental evaluations
Abstract— In this paper, we propose a sub-operation parallelism optimization algorithm in SIMD processor synthesis. Given an initial assembly code and timing constraints, our alg...
Nozomu Togawa, Hideki Kawazu, Jumpei Uchida, Yuich...
104
Voted
SAMOS
2004
Springer
15 years 6 months ago
The Molen Programming Paradigm
— In this paper we present the Molen programming paradigm, which is a sequential consistency paradigm for programming Custom Computing Machines (CCM). The programming paradigm al...
Stamatis Vassiliadis, Georgi Gaydadjiev, Koen Bert...
73
Voted
ICMCS
2007
IEEE
144views Multimedia» more  ICMCS 2007»
15 years 7 months ago
Parallel and Distributed Audio Concealment using Nonlocal Sparse Representations
We present a new class of parallel and distributed audio concealment (PDAC) algorithms which recover lost audio packets at the receiver to fight against channel impairment. The m...
Xin Li
SAC
2009
ACM
15 years 7 months ago
Length-lex bound consistency for knapsack constraints
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
Justin Yip, Pascal Van Hentenryck