3454 search results - page 458 / 691 » Modern computer algebra |
185
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
201
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
183
click to vote
ACSC
2005
IEEE
16 years 26 days ago
2005
IEEE
We present a simple approach for implementing flexible locking strategies in a system of components, which may themselves be composite objects. The approach is flexible in that a ...
194
click to vote
ICCAD
2005
IEEE
16 years 26 days ago
2005
IEEE
— Balanced truncation (BT) model order reduction (MOR) is known for its superior accuracy and computable error bounds. Balanced stochastic truncation (BST) is a particular BT pro...
232
click to vote
ISORC
2005
IEEE
16 years 25 days ago
2005
IEEE
As complexity of real-time embedded software grows, it is desirable to use formal verification techniques to achieve a high level of assurance. We discuss application of model-ch...