Sciweavers

503 search results - page 48 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
126
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
130
Voted
AB
2007
Springer
15 years 7 months ago
Prefix Reversals on Binary and Ternary Strings
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper...
128
Voted
BMCBI
2010
116views more  BMCBI 2010»
15 years 3 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
104
Voted
IPL
2007
99views more  IPL 2007»
15 years 3 months ago
Approximation algorithms for minimizing segments in radiation therapy
Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a...
Shuang Luan, Jared Saia, Maxwell Young
124
Voted
STACS
2009
Springer
15 years 10 months ago
Hardness and Algorithms for Rainbow Connectivity
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...