2647 search results - page 36 / 530 » Solving Term Inequalities |
99
Voted
KBSE
2010
IEEE
15 years 2 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...
110
Voted
DOCENG
2006
ACM
15 years 9 months 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...
120
Voted
GECCO
2005
Springer
15 years 9 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 ...
132
Voted
FLAIRS
2007
15 years 6 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
121
Voted
IJCAI
2001
15 years 5 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...