Sciweavers

1068 search results - page 135 / 214
» On Space Bounded Server Algorithms
Sort
View
VVS
1996
IEEE
102views Visualization» more  VVS 1996»
14 years 2 days ago
Fast Rendering of Irregular Grids
We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (eve...
Cláudio T. Silva, Joseph S. B. Mitchell, Ar...
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
14 years 1 days ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
CP
2006
Springer
13 years 11 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
OPODIS
2007
13 years 9 months ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
CCCG
2009
13 years 9 months ago
The Bichromatic Rectangle Problem in High Dimensions
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...
Jonathan Backer, J. Mark Keil