Sciweavers

363 search results - page 52 / 73
» The SAT Phase Transition
Sort
View
IJCAI
2003
14 years 11 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
14 years 11 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
GLOBECOM
2008
IEEE
14 years 9 months ago
Peer-to-Peer Traffic: From Measurements to Analysis
We report in this paper measurements from France Telecom commercial networks carrying traffic generated and received by ADSL and FTTH customers. By adopting a flowbased approach to...
Fabrice Guillemin, Catherine Rosenberg, Long Le, G...
BIOSYSTEMS
2010
82views more  BIOSYSTEMS 2010»
14 years 9 months ago
A rate distortion approach to protein symmetry
A spontaneous symmetry breaking argument is applied to the problem of protein form, via a Rate Distortion analysis of the relation between genome coding and the final condensation...
Rodrick Wallace
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 9 months ago
On the Stability of Empirical Risk Minimization in the Presence of Multiple Risk Minimizers
Abstract--Recently Kutin and Niyogi investigated several notions of algorithmic stability--a property of a learning map conceptually similar to continuity--showing that training-st...
Benjamin I. P. Rubinstein, Aleksandr Simma