Sciweavers

1920 search results - page 109 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
ESEC
1999
Springer
15 years 8 months ago
Checking Progress with Action Priority: Is it Fair?
The liveness characteristics of a system are intimately related to the notion of fairness. However, the task of explicitly modelling fairness constraints is complicated in practice...
Dimitra Giannakopoulou, Jeff Magee, Jeff Kramer
ECAI
2006
Springer
15 years 7 months ago
Distributed Log-Based Reconciliation
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...
Yek Loong Chong, Youssef Hamadi
TVCG
2008
125views more  TVCG 2008»
15 years 3 months ago
Generic Remeshing of 3D Triangular Meshes with Metric-Dependent Discrete Voronoi Diagrams
In this paper, we propose a generic framework for 3D surface remeshing. Based on a metric-driven Discrete Voronoi Diagram construction, our output is an optimized 3D triangular mes...
Sébastien Valette, Jean-Marc Chassery, R&ea...
PPOPP
1999
ACM
15 years 8 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
ISPD
1999
ACM
89views Hardware» more  ISPD 1999»
15 years 8 months ago
VIA design rule consideration in multi-layer maze routing algorithms
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
Jason Cong, Jie Fang, Kei-Yong Khoo