2109 search results - page 66 / 422 » Solving Necklace Constraint Problems |
123
click to vote
HIS
2004
15 years 6 months ago
2004
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built ...
114
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
247
Voted
AGP
2010
IEEE
15 years 9 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
114
click to vote
AIIA
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. The O-OSCAR software architecture is a problem solving environment for complex scheduling problem that is based on a constraintbased representation. On top of this core r...
127
click to vote
TSP
2010
14 years 11 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...