1795 search results - page 97 / 359 » On the Complexity of Circuit Satisfiability |
KR
2004
Springer
14 years 2 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
ICCCN
2007
IEEE
14 years 21 days ago
2007
IEEE
A good P2P file sharing system is usually expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose such ...
FLAIRS
2001
13 years 10 months ago
2001
We present our consistency support tool BIS, an extension to the electronic product data management system (EPDMS) used at DaimlerChrysler AG to configure the Mercedes lines of pa...
IJCAI
2003
13 years 10 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
DISOPT
2006
13 years 8 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...