3352 search results - page 328 / 671 » Hierarchical Problem Solving and the Bayesian Optimization A... |
168
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
149
click to vote
ANSS
1998
IEEE
15 years 11 months ago
1998
IEEE
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...
154
click to vote
IJCAI
1993
15 years 8 months ago
1993
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...
183
click to vote
IPSN
2005
Springer
16 years 5 days ago
2005
Springer
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
222
click to vote
SIAMIS
2010
15 years 1 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...