Sciweavers

2703 search results - page 498 / 541
» Working Class Hero
Sort
View
MICRO
1996
IEEE
97views Hardware» more  MICRO 1996»
14 years 2 months ago
Modulo Scheduling of Loops in Control-intensive Non-numeric Programs
Much of the previous work on modulo scheduling has targeted numeric programs, in which, often, the majority of the loops are well-behaved loop-counter-based loops without early ex...
Daniel M. Lavery, Wen-mei W. Hwu
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
14 years 2 months ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis
ICDT
2010
ACM
141views Database» more  ICDT 2010»
14 years 2 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 2 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
ATAL
2007
Springer
14 years 1 months ago
Hypotheses refinement under topological communication constraints
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...
Gauvain Bourgne, Gael Hette, Nicolas Maudet, Suzan...