45 search results - page 4 / 9 » Semidefinite Programs: New Search Directions, Smoothing-Type... |
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
13 years 9 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
PLDI
2010
ACM
13 years 10 months ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
SIAMIS
2008
13 years 5 months ago
2008
This paper introduces a new approach to the problem of quantitative reconstruction of an object from few radiographic views. A mixed variable programming problem is formulated in ...
ATAL
2009
Springer
13 years 12 months ago
2009
Springer
In multi-issue negotiations, autonomous agents can act cooperatively to benefit from mutually preferred agreements. However, empirical evidence suggests that they often fail to s...