1612 search results - page 166 / 323 » Analysing Randomized Distributed Algorithms |
124
Voted
IJCSA
2006
15 years 2 months ago
2006
Approaches to indexing and searching feature vectors are an indispensable factor to support similarity search effectively and efficiently. Such feature vectors extracted from real...
135
click to vote
AINA
2009
IEEE
15 years 14 days ago
2009
IEEE
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
126
Voted
JMLR
2010
14 years 9 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
110
Voted
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
109
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
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...