Sciweavers

8671 search results - page 211 / 1735
» A generator for hierarchical problems
Sort
View
ICDCSW
2009
IEEE
15 years 4 months ago
Automated Service Composition in Next-Generation Networks
Dynamic composition of protocol features allows applications to establish connections with custom communication characteristics. Automatically computing possible compositions and ...
Shashank Shanbhag, Xin Huang, Santosh Proddatoori,...
ATMOS
2010
150views Optimization» more  ATMOS 2010»
15 years 5 months ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
Frank Fischer, Christoph Helmberg
HEURISTICS
2002
81views more  HEURISTICS 2002»
15 years 6 months ago
Heuristics for the Phylogeny Problem
In view of the strong increasing number of phylogeny problems and instances, the assessment of the respective optimization algorithms has become harder too. This paper contributes ...
Alexandre A. Andreatta, Celso C. Ribeiro
ITS
2000
Springer
135views Multimedia» more  ITS 2000»
15 years 10 months ago
Analyzing and Generating Mathematical Models: An Algebra II Cognitive Tutor Design Study
This paper reports a formative analysis of a Math Modeling Tool in the Algebra II Cognitive Tutor. This tutor is designed to support algebraic reasoning about real world problems. ...
Albert T. Corbett, Megan McLaughlin, K. Christine ...
4OR
2008
96views more  4OR 2008»
15 years 6 months ago
A column generation approach to train timetabling on a corridor
We propose heuristic and exact algorithms for the (periodic and non-periodic) train timetabling problem on a corridor that are based on the solution of the LP relaxation of an ILP...
Valentina Cacchiani, Alberto Caprara, Paolo Toth