Sciweavers

7123 search results - page 1108 / 1425
» The Ordered Set of Rough Sets
Sort
View
DAM
2006
132views more  DAM 2006»
15 years 6 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
DATAMINE
2006
230views more  DATAMINE 2006»
15 years 6 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
DSS
2006
118views more  DSS 2006»
15 years 6 months ago
Part family formation through fuzzy ART2 neural network
In order to overcome some unavoidable factors, like shift of the part, that influence the crisp neural networks' recognition, the present study is dedicated in developing a n...
R. J. Kuo, Y. T. Su, C. Y. Chiu, Kai-Ying Chen, Fa...
IJAR
2008
114views more  IJAR 2008»
15 years 6 months ago
A definition of subjective possibility
: Based on the setting of exchangeable bets, this paper proposes a subjectivist view of numerical possibility theory. It relies on the assumption that when an agent constructs a pr...
Didier Dubois, Henri Prade, Philippe Smets
ENTCS
2006
136views more  ENTCS 2006»
15 years 6 months ago
Adaptive Application of SAT Solving Techniques
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Ohad Shacham, Karen Yorav
« Prev « First page 1108 / 1425 Last » Next »