1225 search results - page 120 / 245 » The Instance Complexity Conjecture |
PPDP
2009
Springer
14 years 3 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
ICTAI
2008
IEEE
14 years 3 months ago
2008
IEEE
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
CEC
2007
IEEE
14 years 3 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
DSD
2007
IEEE
14 years 3 months ago
2007
IEEE
Developing highly efficient and reliable embedded systems demands hardware/software (HW/SW) co-design and, therefore, co-simulation. In order to be highly configurable, embedded...