Sciweavers

681 search results - page 4 / 137
» Searching with expectations
Sort
View
SLS
2009
Springer
243views Algorithms» more  SLS 2009»
14 years 4 months ago
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
AAAI
2007
14 years 3 days ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
SIGIR
2006
ACM
14 years 3 months ago
User expectations from XML element retrieval
The primary aim of XML element retrieval is to return to users XML elements, rather than whole documents. This poster describes a small study, in which we elicited users’ expect...
Stamatina Betsi, Mounia Lalmas, Anastasios Tombros...
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 10 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
BMCBI
2005
93views more  BMCBI 2005»
13 years 9 months ago
Computing expectation values for RNA motifs using discrete convolutions
Background: Computational biologists use Expectation values (E-values) to estimate the number of solutions that can be expected by chance during a database scan. Here we focus on ...
André Lambert, Matthieu Legendre, Jean-Fred...