Sciweavers

3250 search results - page 381 / 650
» An Algorithm to Solve a Linear Program
Sort
View
JFPLC
2001
15 years 8 months ago
Recherche adaptative et contraintes musicales
We propose an environment for musical constraint solving, in the visual programming language OpenMusic. We describe an implementation of a local search algorithm, called adaptive s...
Charlotte Truchet, Carlos Agon, Gérard Assa...
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
15 years 6 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
SWAT
2010
Springer
294views Algorithms» more  SWAT 2010»
15 years 4 months ago
Bin Packing with Fixed Number of Bins Revisited
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
Klaus Jansen, Stefan Kratsch, Dániel Marx, ...
CCE
2010
15 years 4 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...
ICALP
2005
Springer
16 years 4 days ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman