Sciweavers

1547 search results - page 54 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
EOR
2006
130views more  EOR 2006»
15 years 6 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
AAAI
2010
15 years 7 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
COR
2010
155views more  COR 2010»
15 years 6 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
208
Voted
AUTOMATICA
2011
15 years 1 months ago
Sequential linear quadratic control of bilinear parabolic PDEs based on POD model reduction
We present a framework to solve a finite-time optimal control problem for parabolic partial differential equations (PDEs) with diffusivity-interior actuators, which is motivate...
Chao Xu, Yongsheng Ou, Eugenio Schuster
DNA
2007
Springer
107views Bioinformatics» more  DNA 2007»
16 years 11 days ago
Solutions to Computational Problems Through Gene Assembly
Abstract. Gene assembly in ciliates is an impressive computational process. Ciliates have a unique way of storing their genetic information in two fundamentally different forms wi...
Artiom Alhazov, Ion Petre, Vladimir Rogojin