1816 search results - page 173 / 364 » A New Approach for Solving the Maximum Clique Problem |
130
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
157
click to vote
SMA
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we present a new algorithm for solving the data dependent fairing problem for subdivision surfaces, using Catmull-Clark surfaces as an example. Earlier approaches to...
180
click to vote
AAAI
2006
15 years 8 months ago
2006
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
194
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
154
click to vote
AIPS
2010
15 years 8 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...