2109 search results - page 39 / 422 » Solving Necklace Constraint Problems |
148
click to vote
AI
2003
Springer
15 years 9 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
142
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...
136
click to vote
TSP
2010
14 years 11 months ago
2010
Abstract--This correspondence revisits the joint transceiver optimization problem for multiple-input multiple-output (MIMO) channels. The linear transceiver as well as the transcei...
113
click to vote
SMI
1999
IEEE
15 years 8 months ago
1999
IEEE
We discuss how to solve variational constraint problems involving points, lines and planes. We concentrate on small problems that must be solved simultaneously.
174
click to vote
CSCLP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...