Sciweavers

2111 search results - page 46 / 423
» Understanding the Yarowsky Algorithm
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 5 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
PEWASUN
2006
ACM
14 years 4 months ago
Performance evaluation of backoff algorithms in 802.11 ad-hoc networks
Understanding the performance of backoff algorithms in multihop ad hoc networks is a key feature to design efficient Medium Access Protocols for wireless networks. The 802.11 bac...
Tahiry Razafindralambo, Fabrice Valois
VL
1992
IEEE
135views Visual Languages» more  VL 1992»
14 years 2 months ago
Tidy Animations of Tree Algorithms
In software visualization and algorithm animation it is important that advances in system technologies are accompanied by corresponding advances in animation presentations. In thi...
John T. Stasko, Carlton Reid Turner
ANSS
1991
IEEE
14 years 2 months ago
A provably correct, non-deadlocking parallel event simulation algorithm
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
Meng-Lin Yu, Sumit Ghosh, Erik DeBenedictis
ISCI
2008
166views more  ISCI 2008»
13 years 10 months ago
A discretization algorithm based on Class-Attribute Contingency Coefficient
Discretization algorithms have played an important role in data mining and knowledge discovery. They not only produce a concise summarization of continuous attributes to help the ...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang