Sciweavers

1749 search results - page 193 / 350
» Logic, Optimization, and Constraint Programming
Sort
View
DAC
2012
ACM
11 years 10 months ago
A metric for layout-friendly microarchitecture optimization in high-level synthesis
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
Jason Cong, Bin Liu
DLOG
2009
13 years 5 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
ECOOP
2007
Springer
14 years 2 months ago
A Relational Model of Object Collaborations and Its Use in Reasoning About Relationships
Abstract. Understanding the collaborations that arise between the instances of classes in object-oriented programs is important for the analysis, optimization, or modification of ...
Stephanie Balzer, Thomas R. Gross, Patrick Eugster
ICALP
2007
Springer
14 years 2 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
TASE
2008
IEEE
13 years 8 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi