Sciweavers

1814 search results - page 95 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ICDE
2005
IEEE
176views Database» more  ICDE 2005»
15 years 11 months ago
LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern
Sequence pattern mining is an important research problem because it is the basis of many other applications. Yet how to efficiently implement the mining is difficult due to the ...
Zhenglu Yang, Masaru Kitsuregawa
PPSN
2010
Springer
15 years 4 months ago
Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
Juan Pedro Castro Gutiérrez, Dario Landa-Si...
156
Voted
EMSOFT
2007
Springer
16 years 6 days ago
Slice-balancing H.264 video encoding for improved scalability of multicore decoding
With multicore architectures being introduced to the market, the research community is revisiting problems to evaluate them under the new preconditions set by those new systems. A...
Michael Roitzsch
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 5 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 7 months ago
Voronoi-initializated island models for solving real-coded deceptive problems
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
Santiago Muelas, José Manuel Peña, V...