Sciweavers

499 search results - page 39 / 100
» A Search Algorithm for Clusters in a Network or Graph
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 8 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
SIGIR
2006
ACM
14 years 1 months ago
User modeling for full-text federated search in peer-to-peer networks
User modeling for information retrieval has mostly been studied to improve the effectiveness of information access in centralized repositories. In this paper we explore user model...
Jie Lu, James P. Callan
HUMAN
2003
Springer
14 years 26 days ago
A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
Gunyoung Koh, Duyoung Oh, Heekyoung Woo
ICMLA
2004
13 years 9 months ago
Outlier detection and evaluation by network flow
Detecting outliers is an important topic in data mining. Sometimes the outliers are more interesting than the rest of the data. Outlier identification has lots of applications, su...
Ying Liu, Alan P. Sprague
JSAC
2008
56views more  JSAC 2008»
13 years 7 months ago
An efficient hierarchical optical path network design algorithm based on a traffic demand expression in a cartesian product spac
We propose a hierarchical optical path network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesia...
Isao Yagyu, Hiroshi Hasegawa, Ken-ichi Sato