Sciweavers

920 search results - page 176 / 184
» Computing the Frequency of Partial Orders
Sort
View
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
SAC
2005
ACM
14 years 1 months ago
Value-oriented design of service coordination processes: correctness and trust
The rapid growth of service coordination languages creates a need for methodological support for coordination design. Coordination design differs from workflow design because a ...
Roel Wieringa, Jaap Gordijn
CP
2005
Springer
14 years 1 months ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner
SPAA
2004
ACM
14 years 1 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
FCCM
2002
IEEE
156views VLSI» more  FCCM 2002»
14 years 17 days ago
MPEG-Compliant Entropy Decoding on FPGA-Augmented TriMedia/CPU64
The paper presents a Design Space Exploration (DSE) experiment which has been carried out in order to determine the optimum FPGA–based Variable-Length Decoder (VLD) computing re...
Mihai Sima, Sorin Cotofana, Stamatis Vassiliadis, ...