Sciweavers

654 search results - page 37 / 131
» Ordered Sets and Complete Lattices
Sort
View
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
14 years 26 days ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
VISUALIZATION
1997
IEEE
13 years 11 months ago
The VSBUFFER: visibility ordering of unstructured volume primitives by polygon drawing
Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years resea...
Rüdiger Westermann, Thomas Ertl
AAAI
1996
13 years 9 months ago
Design and Implementation of a Replay Framework Based on a Partial Order Planner
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
Laurie H. Ihrig, Subbarao Kambhampati
IMR
2004
Springer
14 years 1 months ago
Finite Element Mesh Sizing for Surfaces Using Skeleton
The finite element (FE) mesh sizing has great influence on computational time, memory usage, and accuracy of FE analysis. Based on a systematic in-depth study of the geometric com...
William Roshan Quadros, Steven J. Owen, Michael L....
SIGECOM
2003
ACM
124views ECommerce» more  SIGECOM 2003»
14 years 26 days ago
Coalitional games on graphs: core structure, substitutes and frugality
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma