Conference paper
Reasoning about Noisy Sensors in the Situation Calculus
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995
Paper
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
Abstract
For any fixed dimension d, thelinear programming problem with ninequality constraints can be solved on a probabilistic CRCW PRAM withO1994processors almost surely in constant time. The algorithm always findsthe correct solution. Withnd/log2dprocessors, the probability that the algorithm will not finish withinO(d2log2dtime tends to zero exponentially withn. © 1994, ACM. All rights reserved.
Related
Conference paper
The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Takuma Udagawa, Aashka Trivedi, et al.
EMNLP 2023