778 search results - page 15 / 156 » Bounding Smooth Integers |
OL
2007
13 years 7 months ago
2007
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
SIGCOMM
1994
ACM
13 years 11 months ago
1994
ACM
Interframe compression techniques, such as those used in MPEG video, give rise to a coded bit stream where picture sizes di er by a factor of 10 or more. As a result, bu ering is ...
LATIN
1998
Springer
13 years 11 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...