854 search results - page 117 / 171 » Abstracting from Failure Probabilities |
227
click to vote
ILP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
160
click to vote
ENTCS
2008
15 years 4 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
153
click to vote
TELSYS
2002
15 years 4 months ago
2002
Abstract. In the micro-cell-based PCS networks, due to the high user mobility, handoffs occur more frequently. Hence, the classical assumptions, such as the exponential assumptions...
164
Voted
PLDI
2003
ACM
15 years 10 months ago
2003
ACM
We propose a low-overhead sampling infrastructure for gathering information from the executions experienced by a program’s user community. Several example applications illustrat...
145
click to vote
IAT
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...