1510 search results - page 152 / 302 » Upper Probabilities and Additivity |
136
click to vote
TVLSI
1998
15 years 3 months ago
1998
— Excessive instantaneous power consumption may reduce the reliability and performance of VLSI chips. Hence, to synthesize circuits with high reliability, it is imperative to efï...
155
click to vote
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
150
click to vote
TCS
2010
15 years 2 months ago
2010
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
142
click to vote
JCO
2011
14 years 11 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
147
click to vote
TIT
2010
14 years 10 months ago
2010
A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other's...