Sciweavers

976 search results - page 45 / 196
» The Complexity of Timetable Construction Problems
Sort
View
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
14 years 1 months ago
Study Diploid System by a Hamiltonian Cycle Problem Algorithm
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
Dong Xianghui, Ruwei Dai
COR
2010
177views more  COR 2010»
13 years 8 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
AAAI
2010
13 years 5 months ago
A Cross-Entropy Method that Optimizes Partially Decomposable Problems: A New Way to Interpret NMR Spectra
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
Siamak (Moshen) Ravanbakhsh, Barnabás P&oac...
ICALP
2010
Springer
14 years 1 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
ICALT
2005
IEEE
14 years 2 months ago
Designing Web-Based Interactive Learning Environments for Problem-Based Learning
Problem-based learning is a pedagogical strategy that centers learning activities around the investigation and development of solutions to complex and ill-structured authentic pro...
Lin Qiu, Christopher Riesbeck