7225 search results - page 1393 / 1445 » On the Computational Power of Biochemistry |
110
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
We designed and built the Gates Hillman Prediction Market (GHPM) to predict the opening day of the Gates and Hillman Centers, the new computer science buildings at Carnegie Mellon...
129
click to vote
KR
2010
Springer
15 years 6 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
114
click to vote
SAC
2009
ACM
15 years 6 months ago
2009
ACM
The firmware of an electronic voting machine is typically treated as a “trusted” component of the system. Consequently, it is misconstrued to be vulnerable only to an insider...
121
click to vote
CCO
2001
Springer
15 years 5 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...