Sciweavers

2089 search results - page 16 / 418
» A New Problem in String Searching
Sort
View
ISMIR
2003
Springer
125views Music» more  ISMIR 2003»
15 years 2 months ago
A scalable peer-to-peer system for music content and information retrieval
Currently a large percentage of Internet traffic consists of music files, typically stored in MP3 compressed audio format, shared and exchanged over Peer-to-Peer (P2P) networks....
George Tzanetakis, Jun Gao, Peter Steenkiste
EVOW
2009
Springer
14 years 7 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
EOR
2010
104views more  EOR 2010»
14 years 7 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
GECCO
2004
Springer
15 years 3 months ago
Crossover, Population Dynamics, and Convergence in the GAuGE System
This paper presents a study of the effectiveness of a recently presented crossover operator for the GAuGE system. This crossover, unlike the traditional crossover employed previou...
Miguel Nicolau, Conor Ryan
CORR
2010
Springer
200views Education» more  CORR 2010»
14 years 9 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...