1523 search results - page 202 / 305 » The Computational Complexity of Linear Optics |
137
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
— High performance and compliant robot control requires accurate dynamics models which cannot be obtained analytically for sufficiently complex robot systems. In such cases, mac...
126
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
120
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
118
click to vote
LPNMR
2005
Springer
15 years 9 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
118
click to vote
ISPD
2003
ACM
15 years 9 months ago
2003
ACM
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...