Sciweavers

505 search results - page 64 / 101
» Universal Constructions for Large Objects
Sort
View
CCCG
2007
15 years 5 months ago
A Disk-Covering Problem with Application in Optical Interferometry
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
Trung Nguyen, Jean-Daniel Boissonnat, Fréd&...
APAL
2005
107views more  APAL 2005»
15 years 4 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
SIU
2002
97views more  SIU 2002»
15 years 3 months ago
Problem Generators for Rectangular packing problems
Abstract. In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for...
E. Hopper, B. C. H. Turton
FAST
2009
15 years 1 months ago
Scalable Access Controls for Lineage
Lineage stores often contain sensitive information that needs protection from unauthorized access. We build on prior work for security and privacy of lineage information, focusing...
Arnon Rosenthal, Len Seligman, Adriane Chapman, Ba...
158
Voted
PROMISE
2010
14 years 10 months ago
The relationship between search based software engineering and predictive modeling
Search Based Software Engineering (SBSE) is an approach to software engineering in which search based optimization algorithms are used to identify optimal or near optimal solution...
Mark Harman