Sciweavers

7167 search results - page 1259 / 1434
» Answer Set Programming
Sort
View
CCE
2005
13 years 9 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
AIL
2004
113views more  AIL 2004»
13 years 9 months ago
On the Ontological Status of Plans and Norms
This article describes an ontological model of norms. The basic assumption is that a substantial part of a legal system is grounded on the concept of agency. Since a legal system a...
Guido Boella, Leonardo Lesmo, Rossana Damiano
AIR
2004
130views more  AIR 2004»
13 years 9 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
JSS
2007
120views more  JSS 2007»
13 years 9 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
ANOR
2004
116views more  ANOR 2004»
13 years 9 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
« Prev « First page 1259 / 1434 Last » Next »