Sciweavers

1725 search results - page 149 / 345
» Relaxed genetic programming
Sort
View
CCE
2010
14 years 8 months ago
Optimizing the design of complex energy conversion systems by Branch and Cut
The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based...
Turang Ahadi-Oskui, Stefan Vigerske, Ivo Nowak, Ge...
JELIA
2004
Springer
15 years 4 months ago
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Gi...
CLIMA
2004
15 years 4 days ago
Revising Knowledge in Multi-agent Systems Using Revision Programming with Preferences
In this paper we extend the Revision Programming framework--a logic-based framework to express and maintain constraints on knowledge bases-with different forms of preferences. Pref...
Inna Pivkina, Enrico Pontelli, Tran Cao Son
IPCO
2004
93views Optimization» more  IPCO 2004»
15 years 3 days ago
Semi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
I. R. de Farias
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 2 days ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura