14739 search results - page 265 / 2948 » An optimization problem on the sphere |
158
click to vote
ICDE
2012
IEEE
13 years 1 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
CP
1998
Springer
15 years 3 months ago
1998
Springer
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
110
click to vote
DATE
2010
IEEE
14 years 9 months ago
2010
IEEE
—Model-Based Development (MBD) provides an al level of abstraction, the model, which lets engineers focus on the business aspect of the developed system. MBD permits automatic tr...
117
click to vote
COLT
2010
Springer
14 years 9 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...