2168 search results - page 279 / 434 » Randomized Algorithms and Complexity Theory |
142
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
109
Voted
KDD
2004
ACM
16 years 3 months ago
2004
ACM
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
155
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
137
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
117
Voted
ICFCA
2007
Springer
15 years 9 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...