Sciweavers

1068 search results - page 97 / 214
» For completeness, sublogarithmic space is no space
Sort
View
PAM
2012
Springer
12 years 4 months ago
OFLOPS: An Open Framework for OpenFlow Switch Evaluation
Recent efforts in software-defined networks, such as OpenFlow, give unprecedented access into the forwarding plane of networking equipment. When building a network based on OpenFl...
Charalampos Rotsos, Nadi Sarrar, Steve Uhlig, Rob ...
AIPS
2010
13 years 11 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
SIGIR
2006
ACM
14 years 2 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
ASPDAC
2005
ACM
65views Hardware» more  ASPDAC 2005»
14 years 2 months ago
Multilevel full-chip gridless routing considering optical proximity correction
To handle modern routing with nanometer effects, we need to consider designs of variable wire widths and spacings, for which gridless routers are desirable due to their great fle...
Tai-Chen Chen, Yao-Wen Chang
AAAI
1996
13 years 10 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf