Sciweavers

89 search results - page 13 / 18
» A Critique of the Valiant Model
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
FOCS
1993
IEEE
14 years 1 months ago
Scale-sensitive Dimensions, Uniform Convergence, and Learnability
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...
Noga Alon, Shai Ben-David, Nicolò Cesa-Bian...
IJCAI
1989
13 years 11 months ago
Coping With Uncertainty in Map Learning
In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refe...
Kenneth Basye, Thomas Dean, Jeffrey Scott Vitter
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
13 years 9 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
SIGCSE
2010
ACM
231views Education» more  SIGCSE 2010»
14 years 3 months ago
Implementing studio-based learning in CS2
This paper presents an experience in designing, implementing, and evaluating a studio-based learning model for CS2. Adapted from architecture and art education, as well as from co...
T. Dean Hendrix, Lakshman Myneni, N. Hari Narayana...