2109 search results - page 35 / 422 » Solving Necklace Constraint Problems |
145
click to vote
SAT
2007
Springer
15 years 10 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
155
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
124
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
159
click to vote
AI
2005
Springer
15 years 4 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
133
click to vote
ITS
2000
Springer
15 years 8 months ago
2000
Springer
This paper presents an approach to the design of a learning environment in a mathematical domain (elementary combinatorics) where problem solving is based more on modelling than o...