1363 search results - page 25 / 273 » The road coloring problem |
AE
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Markov Random Fields (MRFs) 5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, ou...
4OR
2010
14 years 8 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
100
click to vote
EDBT
2012
ACM
13 years 3 days ago
2012
ACM
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...