2109 search results - page 28 / 422 » Solving Necklace Constraint Problems |
129
click to vote
IJMC
2006
15 years 4 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
132
click to vote
NETWORKS
2008
15 years 4 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
143
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
120
click to vote
IJON
2008
15 years 4 months ago
2008
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
141
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...