Sciweavers

1576 search results - page 216 / 316
» Streaming Algorithms for Independent Sets
Sort
View
FIMI
2003
95views Data Mining» more  FIMI 2003»
15 years 6 months ago
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
Attila Gyenesei, Jukka Teuhola
IJCAI
2003
15 years 6 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov
ECAI
2008
Springer
15 years 6 months ago
Optimal Coalition Structure Generation In Partition Function Games
1 In multi-agent systems (MAS), coalition formation is typically studied using characteristic function game (CFG) representations, where the performance of any coalition is indepen...
Tomasz P. Michalak, Andrew Dowell, Peter McBurney,...
IWCMC
2006
ACM
15 years 11 months ago
Performance evaluation of joint downlink scheduling in multi-cellular OFDMA systems based on IEEE 802.16a
The employment of the OFDMA transmission technique in broadband radio systems shows several benefits. Especially the exploitation of multi-user diversity with the help of sophisti...
Michael Einhaus, Ole Klein, Bernhard Walke, Daniel...
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 8 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó