586 search results - page 2 / 118 » A Recursive Technique for Computing Lower-Bound Performance ... |
138
click to vote
STACS
2009
Springer
16 years 2 days ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
238
click to vote
WIOPT
2011
IEEE
14 years 9 months ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
167
Voted
PAAPP
2000
15 years 5 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
142
Voted
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
138
Voted
AAAI
2006
15 years 6 months ago
2006
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance ...