Sciweavers

2310 search results - page 291 / 462
» Coloring Random Graphs
Sort
View
AAAI
1994
13 years 9 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
JSAT
2006
73views more  JSAT 2006»
13 years 8 months ago
Impurity: Another Phase Transition of SAT
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
Eliezer L. Lozinskii
RSA
2010
118views more  RSA 2010»
13 years 6 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 2 months ago
Detection of objects in noisy images and site percolation on square lattices
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
Mikhail A. Langovoy, Olaf Wittich
INFOCOM
2006
IEEE
14 years 2 months ago
Wealth-Based Evolution Model for the Internet AS-Level Topology
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...
Xiaoming Wang, Dmitri Loguinov