1173 search results - page 48 / 235 » Program Derivation Using Analogy |
104
click to vote
FOCS
1991
IEEE
15 years 5 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
HCI
2007
15 years 3 months ago
2007
Ambient intelligence involves synthesising data from a range of sources in order to exhibit meaningful adaptive behaviour without explicit user direction, driven by inputs from lar...
92
Voted
IPCO
2004
15 years 3 months ago
2004
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
107
Voted
EOR
2006
15 years 2 months ago
2006
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
127
click to vote
CAV
2006
Springer
15 years 6 months ago
2006
Springer
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...