914 search results - page 105 / 183 » The Computational Complexity of Probabilistic Planning |
129
click to vote
JOC
2010
14 years 6 months ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
105
click to vote
WSC
2008
15 years 2 months ago
2008
In an assembly line with high labor proportion, the workforce planning and scheduling is a very complex problem. At the background of increasing labor costs, it is very important ...
MICCAI
2001
Springer
15 years 4 months ago
2001
Springer
Computer systems for surgical planning and training are poised to greatly impact the traditional versions of these tasks. These systems provide an opportunity to learn surgical tec...
HOTOS
2003
IEEE
15 years 5 months ago
2003
IEEE
Understanding the performance of distributed systems requires correlation of thousands of interactions between numerous components — a task best left to a computer. Today’s sy...
106
click to vote
C3S2E
2010
ACM
15 years 29 days ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...