Sciweavers

602 search results - page 102 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
PODC
2005
ACM
14 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
COR
2006
95views more  COR 2006»
13 years 10 months ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
CEC
2009
IEEE
14 years 4 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 11 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
LCR
1998
Springer
137views System Software» more  LCR 1998»
14 years 2 months ago
Integrated Task and Data Parallel Support for Dynamic Applications
There is an emerging class of real-time interactive applications that require the dynamic integration of task and data parallelism. An example is the Smart Kiosk, a free-standing ...
James M. Rehg, Kathleen Knobe, Umakishore Ramachan...