402 search results - page 33 / 81 » Random Search for Hyper-Parameter Optimization |
122
Voted
ICRA
2002
IEEE
15 years 7 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
101
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
140
click to vote
ISCC
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
113
Voted
TPDS
2008
15 years 2 months ago
2008
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
113
Voted
AINA
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...