Sciweavers

407 search results - page 24 / 82
» Optimization of Linear Logic Programs Using Counting Methods
Sort
View
VL
1993
IEEE
159views Visual Languages» more  VL 1993»
13 years 11 months ago
A Visual Logic Programming Language Based on Sets and Partitioning Constraints
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
Lindsey L. Spratt, Allen L. Ambler
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
13 years 11 months ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
OL
2011
177views Neural Networks» more  OL 2011»
12 years 10 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
WSC
1997
13 years 9 months ago
Taking the Work Out of Simulation Modeling: An Application of Technology Integration
This paper presents an implementation methodology appropriate for providing a broad range of proven, classical Operations Research methods and techniques to the simulation modeler...
Gregory S. Baker
KR
2004
Springer
14 years 28 days ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka