4926 search results - page 324 / 986 » Two Graph Algorithms On an Associative Computing Model |
142
click to vote
FM
1999
Springer
15 years 9 months ago
1999
Springer
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
181
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
133
Voted
GD
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
161
click to vote
IJAMCIGI
2010
14 years 11 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
137
click to vote
ICPP
2007
IEEE
15 years 11 months ago
2007
IEEE
We present two parallel algorithms and their Unified Parallel C implementations for Bayesian indoor positioning systems. Our approaches are founded on Markov Chain Monte Carlo si...