4926 search results - page 123 / 986 » Two Graph Algorithms On an Associative Computing Model |
151
Voted
PE
2011
Springer
14 years 9 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
138
Voted
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
113
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
136
click to vote
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
127
Voted
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...