Sciweavers

414 search results - page 23 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
AMAI
2008
Springer
14 years 9 months ago
Stable models and difference logic
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
Ilkka Niemelä
ENTCS
2007
190views more  ENTCS 2007»
14 years 9 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
ICASSP
2008
IEEE
15 years 4 months ago
Discriminative training by iterative linear programming optimization
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
Brian Mak, Benny Ng
ICCAD
2007
IEEE
106views Hardware» more  ICCAD 2007»
15 years 6 months ago
A general model for performance optimization of sequential systems
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...
Dmitry Bufistov, Jordi Cortadella, Michael Kishine...
164
Voted
POPL
2006
ACM
15 years 10 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan