Sciweavers

673 search results - page 75 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
CCGRID
2007
IEEE
13 years 11 months ago
A Hybrid Linear Programming and Evolutionary Algorithm based Approach for On-line Resource Matching in Grid Environments
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
Pawel Garbacki, Vijay K. Naik
WIOPT
2010
IEEE
13 years 5 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
14 years 2 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
ICLP
2005
Springer
14 years 1 months ago
Preference Reasoning
Abstract. Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name...
Francesca Rossi
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 7 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm