Sciweavers

128 search results - page 8 / 26
» A Simple Implementation Technique for Priority Search Queues
Sort
View
IPPS
2002
IEEE
15 years 4 months ago
Scheduling Multiple Data Visualization Query Workloads on a Shared Memory Machine
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
Henrique Andrade, Tahsin M. Kurç, Alan Suss...
ISCA
1993
IEEE
137views Hardware» more  ISCA 1993»
15 years 3 months ago
Transactional Memory: Architectural Support for Lock-Free Data Structures
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
Maurice Herlihy, J. Eliot B. Moss
ENTCS
2006
137views more  ENTCS 2006»
14 years 11 months ago
Compiling Esterel into Static Discrete-Event Code
Executing concurrent specifications on sequential hardware is important for both simulation of systems that are eventually implemented on concurrent hardware and for those most co...
Stephen A. Edwards, Vimal Kapadia, Michael Halasz
AUSAI
2008
Springer
15 years 1 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan
TIP
1998
103views more  TIP 1998»
14 years 11 months ago
Technique for fractal image compression using genetic algorithm
—A new method for fractal image compression is proposed using genetic algorithm (GA) with elitist model. The self transformability property of images is assumed and exploited in ...
Suman K. Mitra, C. A. Murthy, Malay Kumar Kundu