1816 search results - page 75 / 364 » A New Approach for Solving the Maximum Clique Problem |
224
click to vote
CCE
2008
15 years 6 months ago
2008
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
178
click to vote
UAI
1998
15 years 7 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
160
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
290
click to vote
MICCAI
2009
Springer
15 years 8 months ago
2009
Springer
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
180
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...