397 search results - page 55 / 80 » Comparing Two Grammar-Based Generation Algorithms: A Case St... |
CCE
2008
14 years 10 months ago
2008
We present a novel approach for solving different design problems related to single products in multipurpose batch plants: the selection of one production line out of several avai...
BMCBI
2010
14 years 10 months ago
2010
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...
113
click to vote
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
COR
2008
14 years 10 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
INFOCOM
1995
IEEE
15 years 1 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...