Sciweavers

2372 search results - page 106 / 475
» Probabilistic calling context
Sort
View
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 4 months ago
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
ICCV
2001
IEEE
15 years 6 days ago
The Earth Mover's Distance is the Mallows Distance: Some Insights from Statistics
The Earth Mover's distance was first introduced as a purely empirical way to measure texture and color similarities. We show that it has a rigorous probabilistic interpretati...
Elizaveta Levina, Peter J. Bickel
WWW
2005
ACM
14 years 3 months ago
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
Hai Zhuge, Xue Chen, Xiaoping Sun
VLDB
2005
ACM
110views Database» more  VLDB 2005»
14 years 3 months ago
U-DBMS: A Database System for Managing Constantly-Evolving Data
In many systems, sensors are used to acquire information from external environments such as temperature, pressure and locations. Due to continuous changes in these values, and lim...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar
CONCUR
2010
Springer
13 years 10 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini