5128 search results - page 899 / 1026 » When Abstraction Fails |
137
click to vote
DM
1999
15 years 6 months ago
1999
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...
193
click to vote
SOFTWARE
1998
15 years 6 months ago
1998
development is a highly abstract process that requires intense concentration. The authors show that interrupting this process can significantly reduce a developer’s efficiency an...
190
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
abstract Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring...
176
click to vote
TIT
1998
15 years 6 months ago
1998
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
156
click to vote
WINET
2002
15 years 6 months ago
2002
Abstract. This paper addresses the problem of maximizing the capacity of multichannel slotted ALOHA networks subject to a userspecified deadline and a permissible probability of ex...