738 search results - page 145 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
75
Voted
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
— A significant amount of research effort is being carried out by the research community to increase the scope and usefulness of wireless sensor networks; to optimise life time ...
GROUP
2005
ACM
15 years 3 months ago
2005
ACM
Recent proliferation of computing devices has brought attention to heterogeneous collaborative systems, where key challenges arise from the resource limitations and disparities. S...
ISLPED
2004
ACM
15 years 3 months ago
2004
ACM
This paper presents a technique called “workload decomposition” in which the CPU workload is decomposed in two parts: on-chip and off-chip. The on-chip workload signifies the ...
DAC
2005
ACM
14 years 11 months ago
2005
ACM
The need to reuse the performance macromodels of an analog circuit topology challenges existing regression based modeling techniques. A model of good reusability should have a num...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...