522 search results - page 51 / 105 » On the Hardness of the Noncommutative Determinant |
CSCW
2002
ACM
13 years 7 months ago
2002
ACM
Good real time groupware products are hard to develop, in part because evaluating their support for basic teamwork activities is difficult and costly. To address this problem, we ...
TCS
1998
13 years 7 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
TSMC
2002
13 years 7 months ago
2002
There are a lot of industrial applications that can be solved competitively by hard computing, while still requiring the tolerance for imprecision and uncertainty that can be explo...
EWC
2010
13 years 6 months ago
2010
When dealing with computationally expensive simulation codes or process measurement data, surrogate modeling methods are firmly established as facilitators for design space explor...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
—In many robotics applications, knowing the material properties around a robot is often critical for the robot’s successful performance. For example, in mobility, knowledge abo...