Sciweavers

2652 search results - page 175 / 531
» Privacy-preserving linear programming
Sort
View
CPAIOR
2010
Springer
15 years 8 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...
122
Voted
ICLP
1997
Springer
15 years 7 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
120
Voted
CAV
2010
Springer
192views Hardware» more  CAV 2010»
15 years 7 months ago
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, A...
143
Voted
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 7 months ago
Learning recursive programs with cooperative coevolution of genetic code mapping and genotype
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
Garnett Carl Wilson, Malcolm I. Heywood
133
Voted
CPAIOR
2006
Springer
15 years 7 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu