494 search results - page 41 / 99 » Heap Building Bounds |
INFOCOM
2007
IEEE
15 years 5 months ago
2007
IEEE
—In the past years, electronic routers have had trouble keeping up with the increase in optical fiber capacity. As their power consumption has grown exponentially and already ex...
COLT
2001
Springer
15 years 3 months ago
2001
Springer
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
DEDS
2006
14 years 11 months ago
2006
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
JMLR
2006
14 years 11 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
114
click to vote
TC
2002
14 years 10 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...