Sciweavers

5595 search results - page 110 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
GLOBECOM
2008
IEEE
15 years 11 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
Senni Perumal, John S. Baras
CLA
2004
15 years 6 months ago
Fast Factorization of Concept Lattices by Similarity: Solution and an Open Problem
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
Radim Belohlávek, Jiri Dvorak, Jan Outrata
IPPS
2007
IEEE
15 years 11 months ago
A Scalable Cluster Algorithm for Internet Resources
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 5 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
COLING
2008
15 years 6 months ago
A Framework for Identifying Textual Redundancy
The task of identifying redundant information in documents that are generated from multiple sources provides a significant challenge for summarization and QA systems. Traditional ...
Kapil Thadani, Kathleen McKeown