Sciweavers

2503 search results - page 209 / 501
» A study of 3-arc graphs
Sort
View
PE
2000
Springer
101views Optimization» more  PE 2000»
15 years 6 months ago
On the convergence of the power series algorithm
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...
Gerard Hooghiemstra, Ger Koole
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 6 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
DAM
2002
82views more  DAM 2002»
15 years 6 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
PPL
1998
117views more  PPL 1998»
15 years 6 months ago
Messy Broadcasting
In this paper, we describe an ordering of the vertices of a 2-dimensional torus and study the upper bound on the orderly broadcast time. Along with messy broadcasting, orderly bro...
Hovhannes A. Harutyunyan, Arthur L. Liestman
TOCS
1998
83views more  TOCS 1998»
15 years 6 months ago
Using Value Prediction to Increase the Power of Speculative Execution Hardware
This paper presents an experimental and analytical study of value prediction and its impact on speculative execution in superscalar microprocessors. Value prediction is a new para...
Freddy Gabbay, Avi Mendelson