Sciweavers

20441 search results - page 51 / 4089
» Locally Computable Structures
Sort
View
CP
2006
Springer
13 years 11 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
CGF
2010
153views more  CGF 2010»
13 years 7 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton
MICCAI
2010
Springer
13 years 6 months ago
Estimating Local Surface Complexity Maps Using Spherical Harmonic Reconstructions
Abstract. Cortical surface complexity is a potential structural marker for certain diseases such as schizophrenia. In this study, we developed a measure of fractal dimension (FD) c...
Rachel Aine Yotter, Paul M. Thompson, Igor Nenadic...
IPPS
1998
IEEE
13 years 12 months ago
Memory Hierarchy Management for Iterative Graph Structures
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications...
Ibraheem Al-Furaih, Sanjay Ranka
IJCNN
2006
IEEE
14 years 1 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
Shengxiang Yang