Sciweavers

849 search results - page 8 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
ECAI
2010
Springer
13 years 5 months ago
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
Rafael Peñaloza, Baris Sertkaya
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
13 years 7 months ago
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Adam Janiak, Mikhail Y. Kovalyov
DAC
1996
ACM
13 years 12 months ago
Efficient Approximation Algorithms for Floorplan Area Minimization
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
Danny Z. Chen, Xiaobo Hu
UAI
2004
13 years 9 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter