2976 search results - page 365 / 596 » On the bounded integer programming |
146
click to vote
PLDI
1993
ACM
15 years 8 months ago
1993
ACM
We have implemented the first copying garbage collector that permits continuous unimpeded mutator access to the original objects during copying. The garbage collector incremental...
149
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
122
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We introduce a generic type system (based on Milner's sort system) for the synchronous polyadic -calculus, allowing us to mechanise the analysis of input/output capabilities o...
121
click to vote
AGI
2008
15 years 6 months ago
2008
Learning theory and programs to date are inductively bounded: they can be described as "wind-up toys" which can only learn the kinds of things that their designers envisi...
133
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...