1186 search results - page 140 / 238 » Improving Random Walk Performance |
123
Voted
INFOCOM
2000
IEEE
15 years 6 months ago
2000
IEEE
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
114
click to vote
AAAI
2007
15 years 4 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
130
Voted
AAAI
2008
15 years 4 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
115
click to vote
NIPS
2008
15 years 3 months ago
2008
We investigate a topic at the interface of machine learning and cognitive science. Human active learning, where learners can actively query the world for information, is contraste...
131
Voted
IJCAI
2001
15 years 3 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...