1984 search results - page 224 / 397 » Variable mesh optimization for continuous optimization probl... |
147
click to vote
CCCG
2010
15 years 7 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
173
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
205
Voted
EUROGP
1998
Springer
15 years 10 months ago
1998
Springer
The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Kn...
150
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
163
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...