6142 search results - page 735 / 1229 » The Complexity of Partition Functions |
177
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
197
click to vote
DSD
2009
IEEE
16 years 1 months ago
2009
IEEE
—As CMOS process technology advances towards 32nm, SoC complexity continuously grows but its dependability significantly decreases. In this paper, a beamforming chip 1 is designe...
209
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
219
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
179
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...