Sciweavers

599 search results - page 51 / 120
» The repeater tree construction problem
Sort
View
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
14 years 10 months ago
Accelerating genetic programming by frequent subtree mining
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
Yoshitaka Kameya, Junichi Kumagai, Yoshiaki Kurata
INFOCOM
2003
IEEE
15 years 3 months ago
Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations
— Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all...
Arindam Kumar Das
ICPPW
2007
IEEE
15 years 4 months ago
P2P Live Streaming with Tree-Mesh based Hybrid Overlay
P2P technology has been widely adopted in live streaming system for its scalability and low commercial cost. However, tree based system or mesh based system still has to face the ...
Qi Huang, Hai Jin, Xiaofei Liao
DM
2006
63views more  DM 2006»
14 years 9 months ago
Efficient crossover designs for comparing test treatments with a control treatment
Within a large family of crossover designs this paper characterizes the mathematical structures of A-optimal and A-efficient crossover designs for the purpose of statistical compa...
A. Sadam Hedayat, Min Yang
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
14 years 11 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...