Sciweavers

1884 search results - page 186 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
179
Voted
ICCTA
2007
IEEE
16 years 18 days ago
Covering a Set of Points in a Plane Using Two Parallel Rectangles
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
Chandan Saha, Sandip Das
IANDC
2008
80views more  IANDC 2008»
15 years 6 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
CPHYSICS
2004
93views more  CPHYSICS 2004»
15 years 6 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
ICPR
2002
IEEE
16 years 7 months ago
Hexagonal Image Representation for 3-D Photorealistic Reconstruction
A new data structure for representing the color of rays from multiple-view images is presented. The structure is a hexagonal tessellation generated from a buckyball. Using the str...
Hidenori Sato, Hiroto Matsuoka, Akira Onozawa, Hit...
CIBCB
2007
IEEE
16 years 19 days ago
Overestimation for Multiple Sequence Alignment
Abstract— Multiple sequence alignment is an important problem in computational biology. A-star is an algorithm that can be used to find exact alignments. We present a simple mod...
Tristan Cazenave