Sciweavers

2763 search results - page 405 / 553
» The Dangerous 'All' in Specifications
Sort
View
SOICT
2010
15 years 1 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
TON
2010
221views more  TON 2010»
15 years 1 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
TWC
2010
15 years 1 months ago
Efficient Spectrum Leasing via Randomized Silencing of Secondary Users
In this paper, a primary (licensed) user leases part of its resources to independent secondary (unlicensed) terminals in exchange for a tariff in dollars per bit, under the constra...
Rocco Di Taranto, Petar Popovski, Osvaldo Simeone,...
BMCBI
2011
15 years 29 days ago
SNPPicker: High quality tag SNP selection across multiple populations
Background: Linkage Disequilibrium (LD) bin-tagging algorithms identify a reduced set of tag SNPs that can capture the genetic variation in a population without genotyping every s...
Hugues Sicotte, David N. Rider, Gregory A. Poland,...
BMCBI
2011
14 years 10 months ago
New Words in Human Mutagenesis
Background: The substitution rates within different nucleotide contexts are subject to varying levels of bias. The most well known example of such bias is the excess of C to T (C ...
Alexander Y. Panchin, Sergey I. Mitrofanov, Andrei...