9284 search results - page 414 / 1857 » Knowledge State Algorithms |
175
Voted
DSN
2003
IEEE
16 years 22 days ago
2003
IEEE
Software-based active replication is expensive in terms of performance overhead. Multithreading can help improve performance; however, thread scheduling is a source of nondetermin...
180
click to vote
INFOCOM
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
187
click to vote
COLT
1994
Springer
15 years 11 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
210
click to vote
AI
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
198
click to vote
DATE
2008
IEEE
15 years 9 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...