Sciweavers

4325 search results - page 833 / 865
» Incremental computation with names
Sort
View
77
Voted
SIGCOMM
1998
ACM
15 years 3 months ago
Quality of Service Based Routing: A Performance Perspective
Recent studies provide evidence that Quality ofService QoS routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of tra...
George Apostolopoulos, Roch Guérin, Sanjay ...
86
Voted
IUI
1997
ACM
15 years 3 months ago
Helping Users Think in Three Dimensions: Steps Toward Incorporating Spatial Cognition in User Modelling
Historically, efforts at user modelling in educational systems have tended to employ knowledge representations in which symbolic (or "linguistic") cognition is emphasize...
Michael Eisenberg, Ann Nishioka, M. E. Schreiner
88
Voted
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 3 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
85
Voted
INFOCOM
1993
IEEE
15 years 3 months ago
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
Abhay K. Parekh, Robert G. Gallager
123
Voted
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 3 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek