Sciweavers

7092 search results - page 672 / 1419
» Parallelizing constraint programs
Sort
View
JFP
2000
91views more  JFP 2000»
15 years 6 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
CPAIOR
2005
Springer
16 years 4 days ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 10 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
IJCAI
1989
15 years 7 months ago
Constrained Heuristic Search
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
Mark S. Fox, Norman M. Sadeh, Can A. Baykan
COR
2010
105views more  COR 2010»
15 years 6 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...