Sciweavers

5583 search results - page 84 / 1117
» Application of Micro-Genetic Algorithm for Task Based Comput...
Sort
View
159
Voted
WOSP
1998
ACM
15 years 4 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...
ECML
2007
Springer
15 years 6 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
Laurent Boyer 0002, Amaury Habrard, Marc Sebban
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
15 years 17 days ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
112
Voted
CROSSROADS
2010
14 years 7 months ago
Massive multiplayer human computation for fun, money, and survival
Crowdsourcing is an effective tool to solve hard tasks. By bringing 100,000s of people to work on simple tasks that only humans can do, we can go far beyond traditional models of ...
Lukas Biewald
88
Voted
ASPDAC
2006
ACM
230views Hardware» more  ASPDAC 2006»
15 years 6 months ago
Statistical Bellman-Ford algorithm with an application to retiming
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Li...