504 search results - page 35 / 101 » The Complexity of Symmetry-Breaking Formulas |
FLAIRS
2001
13 years 11 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...
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
COCO
2005
Springer
14 years 3 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
SUTC
2010
IEEE
14 years 1 months ago
2010
IEEE
—To maximize the communication throughput for wireless sensing systems, designers have attempted various combinations of protocol design and manual code optimization. Although th...
AAAI
2008
14 years 6 days ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...