Sciweavers

1937 search results - page 172 / 388
» Starting B Specifications from Use Cases
Sort
View
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 10 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
BMCBI
2008
114views more  BMCBI 2008»
15 years 6 months ago
WSPMaker: a web tool for calculating selection pressure in proteins and domains using window-sliding
Background: In the study of adaptive evolution, it is important to detect the protein coding sites where natural selection is acting. In general, the ratio of the rate of non-syno...
Yong Seok Lee, Tae-Hyung Kim, Tae-Wook Kang, Won-H...
DAIS
2007
15 years 8 months ago
Construction and Execution of Adaptable Applications Using an Aspect-Oriented and Model Driven Approach
Constructing and executing distributed applications that can adapt to their current operating context, in order to maintain or enhance Quality of Service (QoS) attribute levels, ar...
Sten A. Lundesgaard, Arnor Solberg, Jon Oldevik, R...
ICMLA
2008
15 years 8 months ago
Tumor Targeting for Lung Cancer Radiotherapy Using Machine Learning Techniques
Accurate lung tumor targeting in real time plays a fundamental role in image-guide radiotherapy of lung cancers. Precise tumor targeting is required for both respiratory gating an...
Tong Lin, Laura Cervino, Xiaoli Tang, Nuno Vasconc...
EOR
2007
73views more  EOR 2007»
15 years 6 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...