1447 search results - page 108 / 290 » Graphs and Path Equilibria |
128
click to vote
EURODAC
1994
IEEE
15 years 8 months ago
1994
IEEE
The use of a realistic component library with multiple implementations of operators, results in cost ef cient designs; slow components can then be used on non-critical paths and t...
135
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
109
click to vote
EJC
2007
15 years 4 months ago
2007
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. The...
164
click to vote
ESA
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
138
Voted
SIAMAM
2010
15 years 2 months ago
2010
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds...