Sciweavers

16257 search results - page 319 / 3252
» D-finiteness: algorithms and applications
Sort
View
CCGRID
2007
IEEE
16 years 1 months ago
Relative Performance of Scheduling Algorithms in Grid Environments
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
Yang Zhang, Charles Koelbel, Ken Kennedy
CAISE
2004
Springer
16 years 3 days ago
Process Mining for Ubiquitous Mobile Systems: An Overview and a Concrete Algorithm
Abstract. Ubiquitous Mobile Systems (UMSs) allow for automated capturing of events. Both mobility and ubiquity are supported by electronic means such as mobile phones and PDAs and ...
Ana Karla A. de Medeiros, Boudewijn F. van Dongen,...
ITNG
2010
IEEE
15 years 11 months ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...
EUROPAR
1999
Springer
15 years 11 months ago
A New Algorithm for Multi-objective Graph Partitioning
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
Kirk Schloegel, George Karypis, Vipin Kumar
ISPAN
1997
IEEE
15 years 11 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal