4007 search results - page 215 / 802 » Computation with imprecise probabilities |
121
Voted
CP
2003
Springer
15 years 9 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
142
click to vote
LCN
2002
IEEE
15 years 9 months ago
2002
IEEE
For a wireless network to effectively deliver services to the mobile users, it must have an efficient way to track them. The location management fulfills this task through locat...
148
click to vote
GI
2001
Springer
15 years 8 months ago
2001
Springer
Abstract: This paper introduces a new method for optimally provisioning and pricing differentiated services, that maximizes profit and maintains a small blocking probability. Reso...
145
click to vote
FGR
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper presents a new technique for the perception of activities using statistical description of spatio-temporal properties. With this approach, the probability of an activit...
134
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...