Sciweavers

16666 search results - page 3332 / 3334
» Descriptive and Computational Complexity
Sort
View
DRUMS
1998
Springer
13 years 11 months ago
Handling uncertainty in control of autonomous robots
Autonomous robots need the ability to move purposefully and without human intervention in real-world environments that have not been speci cally engineered for them. These environm...
Alessandro Saffiotti
BMCBI
2010
98views more  BMCBI 2010»
13 years 7 months ago
miRMaid: a unified programming interface for microRNA data resources
Background: MicroRNAs (miRNAs) are endogenous small RNAs that play a key role in post-transcriptional regulation of gene expression in animals and plants. The number of known miRN...
Anders Jacobsen, Anders Krogh, Sakari Kauppinen, M...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
FSTTCS
2009
Springer
14 years 1 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ICSE
2007
IEEE-ACM
14 years 1 months ago
ACL2s: "The ACL2 Sedan"
ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race ...
Peter C. Dillinger, Panagiotis Manolios, Daron Vro...
« Prev « First page 3332 / 3334 Last » Next »