Sciweavers

1972 search results - page 81 / 395
» connection 2008
Sort
View
67
Voted
ECAI
2008
Springer
15 years 2 months ago
A New Approach to Planning in Networks
Control of networks like those for transportation, power distribution, communication to name a few, provides challenges to planning and scheduling. Many problems can be defined in ...
Jussi Rintanen
90
Voted
DAM
2002
76views more  DAM 2002»
15 years 16 days ago
Edge-pancyclicity of coupled graphs
The coupled graph c(G) of a plane graph G is the graph de
Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhan...
SIAMDM
2010
99views more  SIAMDM 2010»
14 years 11 months ago
Reductions of Young Tableau Bijections
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Scie...
Igor Pak, Ernesto Vallejo
103
Voted
FOCS
2008
IEEE
15 years 7 months ago
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
Glencora Borradaile, Philip N. Klein, Claire Mathi...
90
Voted
GPEM
2008
116views more  GPEM 2008»
15 years 7 days ago
An Eigen analysis of the GP community
The coauthorship and coeditorship relations as recorded in the genetic programming bibliography provide a quantitative view of the GP community. Eigen analysis is used to find the ...
William B. Langdon, Riccardo Poli, Wolfgang Banzha...