Sciweavers

233 search results - page 34 / 47
» On Some Optimization Heuristics for Lesk-Like WSD Algorithms
Sort
View
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 1 months ago
An improved restricted growth function genetic algorithm for the consensus clustering of retinal nerve fibre data
This paper describes an extension to the Restricted Growth Function grouping Genetic Algorithm applied to the Consensus Clustering of a retinal nerve fibre layer data-set. Consens...
Stephen Swift, Allan Tucker, Jason Crampton, David...
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
14 years 1 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
DOLAP
2000
ACM
13 years 12 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
ICDCS
1999
IEEE
13 years 12 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant