Sciweavers

895 search results - page 78 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
MOR
2008
169views more  MOR 2008»
14 years 11 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
100
Voted
EOR
2007
90views more  EOR 2007»
14 years 11 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
ACSD
2009
IEEE
110views Hardware» more  ACSD 2009»
15 years 4 months ago
Variants of the Language Based Synthesis Problem for Petri Nets
The application of synthesis of Petri nets from languages for practical problems has recently attracted increasing attention. However, the classical synthesis problems are often n...
Sebastian Mauser, Robert Lorenz
PAKDD
2007
ACM
203views Data Mining» more  PAKDD 2007»
15 years 5 months ago
Grammar Guided Genetic Programming for Flexible Neural Trees Optimization
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
Peng Wu, Yuehui Chen
COCOON
2003
Springer
15 years 4 months ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...