3838 search results - page 370 / 768 » Techniques for Optimization of Net Algorithms |
184
click to vote
JAIR
2008
15 years 6 months ago
2008
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
170
click to vote
DFT
2008
IEEE
16 years 1 months ago
2008
IEEE
Error detection/correction techniques have been advocated for algorithmic self-assembly. Under rectilinear growth, it requires only two additional tiles, generally referred to as ...
237
click to vote
IWMM
2011
Springer
14 years 9 months ago
2011
Springer
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
212
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
204
click to vote
EMSOFT
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we propose a generalized clustering approach for static data flow subgraphs mapped onto individual processors in Multi-Processor System on Chips (MPSoCs). The goal ...