2137 search results - page 363 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
104
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
111
Voted
ICDE
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
146
click to vote
SODA
2010
ACM
15 years 24 days ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
125
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
116
Voted
JACM
2006
15 years 2 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...