Sciweavers

12825 search results - page 303 / 2565
» Improved PLSOM algorithm
Sort
View
JPDC
2007
81views more  JPDC 2007»
15 years 7 months ago
Improved scheduling in rings
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
Dekel Tsur
JSS
2007
121views more  JSS 2007»
15 years 7 months ago
Opportunistic prioritised clustering framework for improving OODBMS performance
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
Zhen He, Richard Lai, Alonso Marquez, Stephen Blac...
APPROX
2008
Springer
94views Algorithms» more  APPROX 2008»
15 years 9 months ago
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
Eden Chlamtac, Gyanit Singh
CICLING
2010
Springer
15 years 10 months ago
A General Bio-inspired Method to Improve the Short-Text Clustering Task
"Short-text clustering" is a very important research field due to the current tendency for people to use very short documents, e.g. blogs, text-messaging and others. In s...
Diego Ingaramo, Marcelo Errecalde, Paolo Rosso
ICMLA
2007
15 years 8 months ago
Improving gene expression programming performance by using differential evolution
Gene Expression Programming (GEP) is an evolutionary algorithm that incorporates both the idea of a simple, linear chromosome of fixed length used in Genetic Algorithms (GAs) and...
Qiongyun Zhang, Chi Zhou, Weimin Xiao, Peter C. Ne...