1547 search results - page 297 / 310 » Randomized Variable Elimination |
159
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
167
click to vote
IPSN
2004
Springer
15 years 11 months ago
2004
Springer
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
164
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a new method for texture classification which we call the regularized simultaneous autoregressive method (RSAR). The regularization technique is introduc...
160
click to vote
WSNA
2003
ACM
15 years 11 months ago
2003
ACM
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
196
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...