Sciweavers

150 search results - page 4 / 30
» Products of Weighted Logic Programs
Sort
View
ICSM
1998
IEEE
15 years 3 months ago
Detection of Logical Coupling Based on Product Release History
Code-based metrics such as coupling and cohesion are used to measure a system's structural complexity. But dealing with large systems--those consisting of several millions of...
Harald Gall, Karin Hajek, Mehdi Jazayeri
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
15 years 5 months ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...
PPDP
2010
Springer
14 years 10 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
POPL
1994
ACM
15 years 3 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
ENTCS
2007
190views more  ENTCS 2007»
14 years 11 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...