Sciweavers

3211 search results - page 287 / 643
» On the Grundy Number of a Graph
Sort
View
BCB
2010
166views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Fast graph approaches to measure influenza transmission across geographically distributed host types
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
Adrienne Breland, Karen Schlauch, Mehmet Hadi Gune...
BROADNETS
2006
IEEE
16 years 22 days ago
Traffic Grooming Techniques in Optical Networks
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
Yabin Ye, Hagen Woesner, Imrich Chlamtac
APSEC
1997
IEEE
15 years 11 months ago
A Test-case Generation Method for Concurrent Programs Including Task-types
A task-type in concurrent programs is a template of task-instances which are dynamically generated in execution of the programs. The number of the generated taskinstances may not ...
Tetsuro Katayama, Zengo Furukawa, Kazuo Ushijima
TCS
2008
15 years 6 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
SIAMDM
2010
133views more  SIAMDM 2010»
15 years 5 months ago
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gi...