Sciweavers

648 search results - page 46 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
APWEB
2006
Springer
13 years 11 months ago
Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...
Kuo-Yu Huang, Chia-Hui Chang
IS
2008
13 years 7 months ago
Efficient mining of frequent episodes from complex sequences
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
Kuo-Yu Huang, Chia-Hui Chang
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 1 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
14 years 29 days ago
The Effect of Binary Matching Rules in Negative Selection
Negative selection algorithm is one of the most widely used techniques in the field of artificial immune systems. It is primarily used to detect changes in data/behavior patterns...
Fabio A. González, Dipankar Dasgupta, Jonat...
CEC
2008
IEEE
14 years 2 months ago
Evolutionary Multi-objective Simulated Annealing with adaptive and competitive search direction
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
Hui Li, Dario Landa Silva