Sciweavers

2356 search results - page 149 / 472
» Characterizations of postman sets
Sort
View
ANSS
2001
IEEE
15 years 8 months ago
Application of the ATLAS Language in Models of Urban Traffic
ATLAS is a specification language defined to outline city sections to model and simulate traffic flow. Streets are characterized by their size, direction, number of lanes, etc. On...
Andrea Díaz, Verónica Vazquez, Gabri...
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
15 years 8 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
DLT
2008
15 years 6 months ago
When Is Reachability Intrinsically Decidable?
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
Barbara F. Csima, Bakhadyr Khoussainov
BIOCOMP
2006
15 years 6 months ago
Evidence for Functional Protein Fragment Homology in Viral Genome Types
In this paper evidence is presented that supports the hypothesis that amino acid usage bias is a fundamental property of viral genome types. Clues to the biological basis for the o...
John Rose, Rishi Mukhopadhyay
ESANN
2004
15 years 6 months ago
Convergence properties of a fuzzy ARTMAP network
FAMR (Fuzzy ARTMAP with Relevance factor) is a FAM (Fuzzy ARTMAP) neural network used for classification, probability estimation [3], [2], and function approximation [4]. FAMR uses...
Razvan Andonie, Lucian Sasu