Sciweavers

1985 search results - page 133 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
AUSAI
2003
Springer
15 years 9 months ago
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
Ying Kong, Fan Wang, Andrew Lim, Songshan Guo
CCGRID
2009
IEEE
15 years 9 months ago
File Clustering Based Replication Algorithm in a Grid Environment
Replication in grid file systems can significantly improves I/O performance of data-intensive applications. However, most of existing replication techniques apply to individual ...
Hitoshi Sato, Satoshi Matsuoka, Toshio Endo
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 8 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
COCOA
2008
Springer
15 years 5 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
129
Voted
JCP
2008
99views more  JCP 2008»
15 years 3 months ago
Scheduling Algorithm with Potential Behaviors
Abstract--Scheduling algorithm for batch-mode dataintensive jobs is a key issue in data-intensive Grid applications. It focuses on how to minimize the overhead of transferring the ...
Jianhua Jiang, Huifang Ji, Gaochao Xu, Xiaohui Wei