Sciweavers

63 search results - page 2 / 13
» Compactly generated Hausdorff locales
Sort
View
APAL
2006
73views more  APAL 2006»
13 years 9 months ago
Compactness in locales and in formal topology
If a locale is presented by a "flat site", it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is deri...
Steven J. Vickers
LICS
2007
IEEE
14 years 4 months ago
A computable approach to measure and integration theory
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
Abbas Edalat
ISSS
1995
IEEE
96views Hardware» more  ISSS 1995»
14 years 1 months ago
Time-constrained code compaction for DSPs
{DSP algorithms in most cases are subject to hard real-time constraints. In case of programmable DSP processors, meeting those constraints must be ensured by appropriate code gener...
Rainer Leupers, Peter Marwedel
COMPGEOM
2006
ACM
14 years 3 months ago
Engineering a compact parallel delaunay algorithm in 3D
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
Daniel K. Blandford, Guy E. Blelloch, Clemens Kado...
EC
2006
97views ECommerce» more  EC 2006»
13 years 9 months ago
A Step Forward in Studying the Compact Genetic Algorithm
The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm that generates offspring population according to the estimated probabilistic model of the parent pop...
Reza Rastegar, Arash Hariri