Sciweavers

8728 search results - page 300 / 1746
» On Reduct Construction Algorithms
Sort
View
GD
2003
Springer
15 years 12 months ago
HexGraph: Applying Graph Drawing Algorithms to the Game of Hex
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to cr...
Colin Murray, Carsten Friedrich, Peter Eades
ESANN
2008
15 years 8 months ago
Survival SVM: a practical scalable algorithm
This work advances the Support Vector Machine (SVM) based approach for predictive modelling of failure time data as proposed in [1]. The main results concern a drastic reduction in...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
CCR
2006
114views more  CCR 2006»
15 years 6 months ago
A preliminary performance comparison of five machine learning algorithms for practical IP traffic flow classification
The identification of network applications through observation of associated packet traffic flows is vital to the areas of network management and surveillance. Currently popular m...
Nigel Williams, Sebastian Zander, Grenville J. Arm...
IPL
2008
109views more  IPL 2008»
15 years 6 months ago
Description and analysis of a bottom-up DFA minimization algorithm
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
Jorge Almeida, Marc Zeitoun
NETWORKS
2008
15 years 6 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...