Sciweavers

5096 search results - page 764 / 1020
» Landscape of Clustering Algorithms
Sort
View
GECCO
2010
Springer
154views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolutionary learning in networked multi-agent organizations
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...
Jae-Woo Kim
COMPGEOM
2009
ACM
15 years 11 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
INFOCOM
1999
IEEE
15 years 11 months ago
Distributed Wireless Channel Allocation in Networks with Mobile Base Stations
Abstract-In traditional cellular systems with fixed base stations the channel reuse pattern is static and deterministic. When the cell layout is dynamic, due to the mobility of bas...
Sanket Nesargi, Ravi Prakash
DAC
1994
ACM
15 years 10 months ago
Acyclic Multi-Way Partitioning of Boolean Networks
Acyclic partitioning on combinational boolean networks has wide range of applications, from multiple FPGA chip partitioning to parallel circuit simulation. In this paper, we prese...
Jason Cong, Zheng Li, Rajive Bagrodia
ICCCN
2007
IEEE
15 years 10 months ago
Exploring Load-Balance to Dispatch Mobile Sensors in Wireless Sensor Networks
In this paper, a hybrid sensor network consisting of static and mobile sensors is considered, where static sensors are used to detect events, and mobile sensors can move to event l...
You-Chiun Wang, Wen-Chih Peng, Min-Hsien Chang, Yu...