Sciweavers

129 search results - page 7 / 26
» arc 2010
Sort
View
CEC
2010
IEEE
13 years 10 months ago
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
Liang Feng, Yew-Soon Ong, Quang Huy Nguyen 0001, A...
NETWORKS
2010
13 years 8 months ago
A mean-variance model for the minimum cost flow problem with stochastic arc costs
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
Stephen D. Boyles, S. Travis Waller
WG
2010
Springer
13 years 8 months ago
Parameterized Complexity of the Arc-Preserving Subsequence Problem
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
Dániel Marx, Ildikó Schlotter
CDC
2010
IEEE
126views Control Systems» more  CDC 2010»
13 years 4 months ago
Bifurcation of singular arcs in an optimal control problem for cancer immune system interactions under treatment
A mathematical model for cancer treatment that includes immunological activity is considered as an optimal control problem. In the uncontrolled system there exist both a region of ...
Urszula Ledzewicz, Mohammad Naghnaeian, Heinz Sch&...
SOFSEM
2010
Springer
14 years 6 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz