Sciweavers

6562 search results - page 119 / 1313
» Noetherianity and Combination Problems
Sort
View
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
15 years 10 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
148
Voted
EVOW
2007
Springer
15 years 10 months ago
Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...
Napoleão Nepomuceno, Plácido Rog&eac...
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
15 years 10 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
GECCO
2005
Springer
15 years 10 months ago
A theoretical analysis of the HIFF problem
We present a theoretical analysis of Watson’s Hierarchicalif-and-only-if (HIFF) problem using a variety of tools. These include schema theory and course graining, the concept of...
Nicholas Freitag McPhee, Ellery Fussell Crane
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
15 years 8 months ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...