Sciweavers

3604 search results - page 626 / 721
» All Common Subsequences
Sort
View
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
15 years 5 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
15 years 5 months ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
SPAA
2005
ACM
15 years 5 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
15 years 5 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 5 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...