6456 search results - page 101 / 1292 » Constraint Solving on Terms |
140
click to vote
COR
2008
15 years 6 months ago
2008
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic...
224
click to vote
TSMC
2008
15 years 6 months ago
2008
This paper proposes a new perspective for solving systems of complex nonlinear equations by simply viewing them as a multiobjective optimization problem. Every equation in the syst...
134
click to vote
KBSE
2010
IEEE
15 years 4 months ago
2010
IEEE
The installation of software packages depends on the correct resolution of dependencies and conflicts between packages. This problem is NP-complete and, as expected, is a hard ta...
135
click to vote
DOCENG
2006
ACM
16 years 4 days ago
2006
ACM
Automatic table layout is required in web applications. Unfortunately, this is NP-hard for reasonable layout requirements such as minimizing table height for a given width. One ap...
151
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...