1963 search results - page 177 / 393 » The Maximum Solution Problem on Graphs |
125
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
120
click to vote
SIAMDM
2011
14 years 9 months ago
2011
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...
147
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
126
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we discuss the information–theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate cap...
125
Voted
ICRA
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...