2100 search results - page 48 / 420 » Fundamentals of the problem |
ISRR
2005
Springer
14 years 3 months ago
2005
Springer
ct This paper presents the author’s view on the main challenges for autonomous operation in surface mining environment. A brief overview of the mine operation is presented showin...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
BIOCOMP
2006
13 years 11 months ago
2006
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biology. In this paper we present an improved algorithm for sorting by reversals. Our...
SIAMCOMP
2000
13 years 10 months ago
2000
This paper studies various algorithmic issues in reconstructing a species tree from gene trees under the duplication and the mutation cost model. This is a fundamental problem in c...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...