Sciweavers

945 search results - page 60 / 189
» Incremental Branching Programs
Sort
View
4OR
2006
99views more  4OR 2006»
13 years 9 months ago
A decomposition-based solution method for stochastic mixed integer nonlinear programs
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
Maria Elena Bruni
ENTCS
2008
150views more  ENTCS 2008»
13 years 9 months ago
Analyzing Security Scenarios Using Defence Trees and Answer Set Programming
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
ASP
2005
Springer
14 years 2 months ago
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
Enrico Giunchiglia, Marco Maratea
CANDC
2000
ACM
13 years 8 months ago
Step by Step Filter Based Program for Calculations of Highly Informative Derivative Curves
We have developed a microcomputer program, based on a recently described approach called step by step filter (SBSF), for calculation of derivative curves directly from spectra rec...
Vesselin Petrov, Liudmil Antonov, Hitoshi Ehara, N...
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
14 years 2 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...