Sciweavers

4860 search results - page 259 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
101
Voted
TON
2008
119views more  TON 2008»
15 years 16 days ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
SPAA
2009
ACM
15 years 7 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
120
Voted
CCR
2002
86views more  CCR 2002»
15 years 14 days ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 11 months ago
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
Hung-Chin Jang
96
Voted
BMCBI
2008
105views more  BMCBI 2008»
15 years 23 days ago
A gene pattern mining algorithm using interchangeable gene sets for prokaryotes
Background: Mining gene patterns that are common to multiple genomes is an important biological problem, which can lead us to novel biological insights. When family classification...
Meng Hu, Kwangmin Choi, Wei Su, Sun Kim, Jiong Yan...