4488 search results - page 2 / 898 » Properties of NP-Complete Sets |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...
CEC
2005
IEEE
13 years 7 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
IANDC
2006
13 years 5 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
CGO
2003
IEEE
13 years 10 months ago
2003
IEEE
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...