Sciweavers

44651 search results - page 262 / 8931
» A Generalization of the Least General Generalization
Sort
View
AAAI
1998
15 years 8 months ago
Generalizing Partial Order and Dynamic Backtracking
RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB)and partial order dynamicbacktracking (PDB) have been presented. These algorithms have the property to be additi...
Christian Bliek
IPCO
1998
152views Optimization» more  IPCO 1998»
15 years 8 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
199
Voted
GRAPHICSINTERFACE
1997
15 years 8 months ago
Multiresolution BSP Trees Applied to Terrain, Transparency, and General Objects
We present a system for incorporating multiple level of detail (LOD) models of 3D objects within a single hierarchical data structure. This system was designed for a scientific vi...
Charles Wiley, A. T. Campbell III, Stephen A. Szyg...
WSC
1998
15 years 8 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan
AAAI
1994
15 years 8 months ago
L* Parsing: A General Framework for Syntactic Analysis of Natural Language
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...
Eric K. Jones, Linton M. Miller