Sciweavers

21319 search results - page 3928 / 4264
» An Approach for Method Reengineering
Sort
View
LCPC
2009
Springer
15 years 11 months ago
Using the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
Mounira Bachir, David Gregg, Sid Ahmed Ali Touati
DAWAK
2001
Springer
15 years 11 months ago
Matchmaking for Structured Objects
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
Thomas Eiter, Daniel Veit, Jörg P. Mülle...
211
Voted
DIS
2001
Springer
15 years 11 months ago
Computational Discovery of Communicable Knowledge: Symposium Report
Abstract. The Symposium on Computational Discovery of Communicable Knowledge was held from March 24 to 25, 2001, at Stanford University. Fifteen speakers reviewed recent advances i...
Saso Dzeroski, Pat Langley
152
Voted
ICCS
2001
Springer
15 years 11 months ago
A Feynman-Kac Path-Integral Implementation for Poisson's Equation
This study presents a Feynman–Kac path-integral implementation for solving the Dirichlet problem for Poisson’s equation. The algorithm is a modified “walk on spheres” (WO...
Chi-Ok Hwang, Michael Mascagni
DCC
2000
IEEE
15 years 11 months ago
Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
Nedeljko Varnica, Michael Fleming, Michelle Effros
« Prev « First page 3928 / 4264 Last » Next »