374 search results - page 41 / 75 » sum 2010 |
114
click to vote
SIROCCO
2010
15 years 4 months ago
2010
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
125
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
126
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: A good scoring function is essential for molecular docking computations. In conventional scoring functions, energy terms modeling pairwise interactions are cumulativel...
118
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
113
click to vote
CMPB
2010
15 years 3 months ago
2010
We demonstrate the use of highly parallel graphics processing units (GPUs) to accelerate the Superposition/Convolution (S/C) algorithm to interactive rates while reducing the numbe...