Sciweavers

3433 search results - page 176 / 687
» Heuristics for a bidding problem
Sort
View
TEC
2002
163views more  TEC 2002»
15 years 6 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
TSMC
2010
15 years 1 months ago
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
Giovanni Righini, Emanuele Tresoldi
DNA
2009
Springer
185views Bioinformatics» more  DNA 2009»
16 years 1 months ago
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Knowledge of energy barriers between pairs of secondary structures for a given DNA or RNA molecule is useful, both in understanding RNA function in biological settings and in desig...
Ján Manuch, Chris Thachuk, Ladislav Stacho,...
JVA
2006
IEEE
16 years 18 days ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
EVOW
2005
Springer
16 years 3 days ago
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem
We describe how the standard genotype-phenotype mapping process of Grammatical Evolution (GE) can be enhanced with an attribute grammar to allow GE to operate as a decoder-based Ev...
Robert Cleary, Michael O'Neill