536 search results - page 70 / 108 » A Translational Approach to Constraint Answer Set Solving |
129
Voted
FPGA
2004
ACM
15 years 7 months ago
2004
ACM
This paper presents a new approach to timing optimization for FPGA designs, namely incremental physical resynthesis, to answer the challenge of effectively integrating logic and p...
155
click to vote
SARA
2009
Springer
15 years 10 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
158
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
140
Voted
IJKSR
2011
14 years 7 months ago
2011
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
121
Voted
PLDI
2000
ACM
15 years 8 months ago
2000
ACM
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...