Sciweavers

5329 search results - page 20 / 1066
» The Weighted Majority Algorithm
Sort
View
ROCAI
2004
Springer
14 years 27 days ago
ROC Analysis of Example Weighting in Subgroup Discovery
This paper presents two new ways of example weighting for subgroup discovery. The proposed example weighting schemes are applicable to any subgroup discovery algorithm that uses th...
Branko Kavsek, Nada Lavrac, Ljupco Todorovski
JAIR
2008
119views more  JAIR 2008»
13 years 7 months ago
A Multiagent Reinforcement Learning Algorithm with Non-linear Dynamics
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Due to the complexity of the problem, the majority of the previo...
Sherief Abdallah, Victor R. Lesser
IPL
2006
139views more  IPL 2006»
13 years 7 months ago
An adjustable linear time parallel algorithm for maximum weight bipartite matching
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
Morteza Fayyazi, David R. Kaeli, Waleed Meleis
TASE
2008
IEEE
13 years 7 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
CANDC
2006
ACM
13 years 7 months ago
An RNA folding algorithm including pseudoknots based on dynamic weighted matching
On the basis of maximum weighted matching (MWM) algorithm, we introduced a dynamic weight related with stem length and used a recursive algorithm to predict RNA secondary structur...
Haijun Liu, Dong Xu, Jianlin Shao, Yifei Wang