1215 search results - page 186 / 243 » Combinatorics |
145
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
162
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
141
click to vote
CPM
2003
Springer
15 years 11 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
160
click to vote
CPM
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...
141
click to vote
AGENTS
2000
Springer
15 years 10 months ago
2000
Springer
Design-to-Criteria builds custom schedules for agents that meet hard temporal constraints, hard resource constraints, and soft constraints stemming from soft task interactions or ...