129 search results - page 7 / 26 » arcs 2010 |
141
Voted
CEC
2010
IEEE
15 years 3 months ago
2010
IEEE
— 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 ...
122
Voted
NETWORKS
2010
15 years 1 months ago
2010
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...
132
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
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...
130
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
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 ...
119
Voted
SOFSEM
2010
Springer
16 years 12 days ago
2010
Springer
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-...