2254 search results - page 283 / 451 » Computing the minimal covering set |
162
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
186
click to vote
TPDS
2002
15 years 6 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
149
click to vote
DMS
2010
15 years 5 months ago
2010
This work was proposed as a Doctoral Thesis of Applied Computing Course at Brazilian National Institute for Space Research (INPE) and is a ongoing work. The main purpose of SICSDA ...
171
click to vote
ORL
2010
15 years 5 months ago
2010
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
163
click to vote
DLOG
2010
15 years 4 months ago
2010
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on co...