Sciweavers

1648 search results - page 123 / 330
» Where to Build a Door
Sort
View
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 4 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...
CIKM
2009
Springer
14 years 4 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 4 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
ISQED
2007
IEEE
134views Hardware» more  ISQED 2007»
14 years 4 months ago
Challenges in Evaluations for a Typical-Case Design Methodology
According to the current trend of increasing variations in process technologies and thus in performance, the conservative worst-case design will not work since design margins can ...
Yuji Kunitake, Akihiro Chiyonobu, Koichiro Tanaka,...
IWCLS
2007
Springer
14 years 4 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull