11328 search results - page 144 / 2266 » Timed Branching Processes |
142
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
169
click to vote
SPIN
2001
Springer
15 years 8 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
116
Voted
ICCSA
2010
Springer
15 years 5 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
134
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
147
Voted
MSV
2004
15 years 4 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...