Sciweavers

2034 search results - page 354 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
FSTTCS
2008
Springer
13 years 9 months ago
Pruning 2-Connected Graphs
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
Chandra Chekuri, Nitish Korula
SOCO
2002
Springer
13 years 7 months ago
Granular neural web agents for stock prediction
A granular neural Web-based stock prediction agent is developed using the granular neural network (GNN) that can discover fuzzy rules. Stock data sets are downloaded from www.yahoo...
Yan-Qing Zhang, Somasheker Akkaladevi, George J. V...
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
BMCBI
2011
12 years 11 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
EUROSYS
2011
ACM
12 years 11 months ago
Is co-scheduling too expensive for SMP VMs?
Symmetric multiprocessing (SMP) virtual machines (VMs) allow users to take advantage of a multiprocessor infrastructure. Despite the advantage, SMP VMs can cause synchronization l...
Orathai Sukwong, Hyong S. Kim