2127 search results - page 186 / 426 » Computing large matchings fast |
165
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
157
click to vote
JAIR
2006
15 years 4 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
159
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
143
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
116
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: The success achieved by genome-wide association (GWA) studies in the identification of candidate loci for complex diseases has been accompanied by an inability to expl...