2446 search results - page 250 / 490 » Choiceless Polynomial Time |
119
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the b...
140
click to vote
JUCS
2007
15 years 4 months ago
2007
: We investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechan...
146
click to vote
DAM
1999
15 years 4 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
155
Voted
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
180
Voted
OL
2011
14 years 11 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...