2313 search results - page 234 / 463 » On Heuristic Time Hierarchies |
197
click to vote
CLOUDCOM
2010
Springer
15 years 4 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
168
click to vote
HIPC
2009
Springer
15 years 4 months ago
2009
Springer
We investigate the problem of scheduling in OFDMbased multihop relay networks with special emphasis on IEEE 802.16j based WiMAX networks. In such networks, scheduling is the probl...
220
click to vote
HEURISTICS
2010
15 years 4 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
193
click to vote
ACL
2011
14 years 10 months ago
2011
Information extraction (IE) holds the promise of generating a large-scale knowledge base from the Web’s natural language text. Knowledge-based weak supervision, using structured...
212
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...