4066 search results - page 140 / 814 » Almost Complete Sets |
182
click to vote
RSA
2002
15 years 6 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
209
Voted
COMPSAC
2006
IEEE
16 years 1 months ago
2006
IEEE
The Sage development method and associated tool set support an incremental, iterative, model-driven process to build and maintain high assurance, reactive multi-agent systems. A s...
157
Voted
AUTOMATICA
2002
15 years 6 months ago
2002
This paper investigates the controllability and reachability of switched linear control systems. It is proven that both the controllable and reachable sets are subspaces of the to...
163
Voted
ISPASS
2006
IEEE
16 years 1 months ago
2006
IEEE
— Due to the long simulation times of the reference input sets, microarchitects resort to alternative techniques to speed up cycle-accurate simulations. However, the reduction in...
158
Voted
ESA
1999
Springer
15 years 11 months ago
1999
Springer
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...