Sciweavers

628 search results - page 2 / 126
» The minimum shift design problem
Sort
View
PIMRC
2008
IEEE
13 years 11 months ago
The design and detection of signature sequences in time-frequency selective channel
Abstract— In a slot-synchronized wireless communication system, a set of signature sequences can be derived by circularly shifting a base sequence with good auto correlation prop...
Jiann-Ching Guey
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
13 years 11 months ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
JCO
2008
134views more  JCO 2008»
13 years 5 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
BIBE
2009
IEEE
126views Bioinformatics» more  BIBE 2009»
14 years 4 days ago
Mining Positional Association Super-Rules on Fixed-Size Protein Sequence Motifs
— Protein sequence motifs information is crucial to the analysis of biologically significant regions. The conserved regions have the potential to determine the role of the protei...
Bernard Chen, Sinan Kockara
EOR
2007
174views more  EOR 2007»
13 years 5 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick