Sciweavers

1346 search results - page 160 / 270
» On the number of rectangular partitions
Sort
View
CPHYSICS
2004
93views more  CPHYSICS 2004»
15 years 1 months ago
Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
Gernot Schaller, Michael Meyer-Hermann
DPD
2000
93views more  DPD 2000»
15 years 1 months ago
Ontological Approach for Information Discovery in Internet Databases
The Internet has solved the age-old problem of network connectivity and thus enabling the potential access to, and data sharing among large numbers of databases. However, enabling ...
Mourad Ouzzani, Boualem Benatallah, Athman Bouguet...
GPEM
2000
103views more  GPEM 2000»
15 years 1 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
IPL
2002
118views more  IPL 2002»
15 years 1 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
WCET
2010
14 years 11 months ago
On the Use of Context Information for Precise Measurement-Based Execution Time Estimation
The present paper investigates the influence of the execution history on the precision of measurementbased execution time estimates for embedded software. A new approach to timing...
Stefan Stattelmann, Florian Martin