Sciweavers

7930 search results - page 94 / 1586
» Greedy in Approximation Algorithms
Sort
View
STOC
2001
ACM
153views Algorithms» more  STOC 2001»
16 years 6 months ago
Applications of approximation algorithms to cooperative games
Kamal Jain, Vijay V. Vazirani
AAAI
2007
15 years 8 months ago
Refutation by Randomised General Resolution
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
Steven David Prestwich, Inês Lynce
IJCAI
2003
15 years 7 months ago
Skewing: An Efficient Alternative to Lookahead for Decision Tree Induction
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
David Page, Soumya Ray
INFFUS
2010
104views more  INFFUS 2010»
15 years 3 months ago
A selection approach for scalable fuzzy integral combination
We consider the problem of collective decision-making from an arbitrary set of classifiers under Sugeno fuzzy integral (S-FI). We assume that classifiers are given, i.e., they can...
Pilar Bulacio, Serge Guillaume, Elizabeth Tapia, L...