1816 search results - page 24 / 364 » A New Approach for Solving the Maximum Clique Problem |
CVPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
IOR
2006
14 years 11 months ago
2006
We consider the problem of radiation therapy treatment planning for cancer patients. During radiation therapy, beams of radiation pass through a patient, killing both cancerous an...
104
click to vote
IJCSA
2007
14 years 11 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
101
click to vote
ANOR
2011
14 years 6 months ago
2011
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
122
click to vote
TEC
2002
14 years 11 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...