Sciweavers

346 search results - page 66 / 70
» How good is a span of terms
Sort
View
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 8 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
RIVF
2003
13 years 8 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
AAAI
1998
13 years 8 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
ATAL
2010
Springer
13 years 8 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...
ATAL
2010
Springer
13 years 7 months ago
Incremental plan aggregation for generating policies in MDPs
Despite the recent advances in planning with MDPs, the problem of generating good policies is still hard. This paper describes a way to generate policies in MDPs by (1) determiniz...
Florent Teichteil-Königsbuch, Ugur Kuter, Gui...