67 search results - page 7 / 14 » A New Exact Algorithm for the Two-Sided Crossing Minimizatio... |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
JMLR
2010
13 years 7 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
ICCAD
2003
IEEE
14 years 5 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
This paper deals with the adaptive variance scaling issue in continuous Estimation of Distribution Algorithms. A phenomenon is discovered that current adaptive variance scaling me...