5165 search results - page 555 / 1033 » Consistency of the Neighbor-Net Algorithm |
169
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
158
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
180
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
165
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
183
click to vote
TACAS
2000
Springer
15 years 10 months ago
2000
Springer
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...