197 search results - page 34 / 40 » Complexity of Max-SAT using stochastic algorithms |
ISCAS
1999
IEEE
15 years 1 months ago
1999
IEEE
High-level power design presents a complex, multiobjective problem that involves the simultaneous optimisation of competing criteria such as speed, area and power. It is difficult...
125
click to vote
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
EUROPAR
2010
Springer
14 years 10 months ago
2010
Springer
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
110
click to vote
DATAMINE
2010
14 years 9 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
101
click to vote
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...