679 search results - page 112 / 136 » Using decision problems in public key cryptography |
103
click to vote
AI
2000
Springer
15 years 1 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
114
click to vote
IPL
2010
14 years 11 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
112
click to vote
CHB
2011
14 years 4 months ago
2011
Admittedly this is a presumptuous title that should never be used when reporting on individual research advances. Wisdom is just not a scientific concept. In this case, though, w...
120
click to vote
AAAI
2006
15 years 2 months ago
2006
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...
102
click to vote
DAC
2001
ACM
16 years 2 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...