1722 search results - page 156 / 345 » On the sample mean of graphs |
176
click to vote
SLS
2009
Springer
16 years 1 months ago
2009
Springer
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...
146
click to vote
HICSS
2008
IEEE
16 years 27 days ago
2008
IEEE
The number of publications in biomedicine is increasing enormously each year. To help researchers digest the information in these documents, text mining tools are being developed ...
159
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
220
click to vote
INFOVIS
2005
IEEE
16 years 1 days ago
2005
IEEE
We present a system that allows users to interactively explore complex flow scenarios represented as Sankey diagrams. Our system provides an overview of the flow graph and allows ...
168
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...