361 search results - page 59 / 73 » Approximate counting by dynamic programming |
HPDC
2011
IEEE
12 years 11 months ago
2011
IEEE
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
TLDI
2009
ACM
14 years 4 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
CLUSTER
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
AAAI
2008
13 years 9 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...