Sciweavers

16404 search results - page 2598 / 3281
» A set coverage problem
Sort
View
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
16 years 22 days ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
16 years 22 days ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
16 years 22 days ago
The Framework of an XML Semantic Caching System
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of caching results...
Wanhong Xu
ACII
2005
Springer
16 years 21 days ago
Pronunciation Learning and Foreign Accent Reduction by an Audiovisual Feedback System
Abstract. Global integration and migration force people to learn additional languages. With respect to major languages, the acquisition is already initiated at primary school but a...
Oliver Jokisch, Uwe Koloska, Diane Hirschfeld, R&u...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
16 years 21 days ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
« Prev « First page 2598 / 3281 Last » Next »