882 search results - page 38 / 177 » On self-embeddings of computable linear orderings |
DATE
2006
IEEE
15 years 1 months ago
2006
IEEE
In this paper, we propose two FPGA-area allocation algorithms based on profiling results for reducing the impact on performance of dynamic reconfiguration overheads. The problem o...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
FMSD
2006
14 years 9 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
ICCV
2005
IEEE
15 years 3 months ago
2005
IEEE
The representation and modelling of regions is an important topic in computer vision. In this paper, we represent a region via a level set of a ‘phase field’ function. The fu...
120
click to vote
PODC
2012
ACM
13 years 7 days ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...