2430 search results - page 215 / 486 » Computing Tutte Polynomials |
141
click to vote
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered...
107
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We study the stability of the commonly used packet forwarding protocol, FIFO (First In First Out), in the adversarial queueing model. We prove that FIFO can become unstable, i.e.,...
155
click to vote
CIE
2010
Springer
15 years 9 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
135
click to vote
PPAM
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
119
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with w...