Sciweavers

195 search results - page 12 / 39
» Evolving by Maximizing the Number of Rules: Complexity Study
Sort
View
CSR
2007
Springer
15 years 3 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ESA
2007
Springer
150views Algorithms» more  ESA 2007»
15 years 3 months ago
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...
Amos Israeli, Dror Rawitz, Oran Sharon
83
Voted
ISSTA
1989
ACM
15 years 1 months ago
The Logic of Propagation in the Inscape Environment
The Inscape Environment research project addresses issues in supporting the development of large systems by large numbers of programmers. One aspect of this research is the ‘‘...
D. Perry
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
14 years 9 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
GECCO
2005
Springer
133views Optimization» more  GECCO 2005»
15 years 3 months ago
Heuristic rules embedded genetic algorithm to solve in-core fuel management optimization problem
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...
Fatih Alim, Kostadin Ivanov