224 search results - page 33 / 45 » Algorithms for Solving Boolean Satisfiability in Combination... |
122
Voted
AI
2010
Springer
15 years 3 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
127
Voted
DAC
2008
ACM
16 years 4 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
149
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
128
Voted
FPGA
2001
ACM
15 years 8 months ago
2001
ACM
Conventional technology mapping algorithms for SRAM-based Field Programmable Gate Arrays (FPGAs) are normally carried out on a fixed logic decomposition of a circuit. The impact o...
136
Voted
DAC
2004
ACM
16 years 4 months ago
2004
ACM
Long design cycles due to the inability to predict silicon realities is a well-known problem that plagues analog/RF integrated circuit product development. As this problem worsens...