1816 search results - page 249 / 364 » A New Approach for Solving the Maximum Clique Problem |
199
click to vote
AUSSOIS
2001
Springer
15 years 11 months ago
2001
Springer
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
139
click to vote
IJAR
2007
15 years 6 months ago
2007
The problem of merging multiple sources of information is central in many information processing areas such as databases integrating problems, multiple criteria decision making, e...
161
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
170
click to vote
FAABS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
161
click to vote
ICONIP
2007
15 years 8 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...