Sciweavers

952 search results - page 49 / 191
» Computational complexity of stochastic programming problems
Sort
View
113
Voted
ATMOS
2007
114views Optimization» more  ATMOS 2007»
15 years 2 months ago
Fast Approaches to Robust Railway Timetabling
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
Matteo Fischetti, Arrigo Zanette, Domenico Salvagn...
120
Voted
FOCS
1998
IEEE
15 years 4 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
MOR
2006
95views more  MOR 2006»
15 years 12 days ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
117
Voted
ICSOC
2010
Springer
14 years 10 months ago
Programmable Fault Injection Testbeds for Complex SOA
Abstract. The modularity of Service-oriented Architectures (SOA) allows to establish complex distributed systems comprising e.g., services, clients, brokers, and workflow engines. ...
Lukasz Juszczyk, Schahram Dustdar
EUROGP
2008
Springer
15 years 2 months ago
PlasmidPL: A Plasmid-Inspired Language for Genetic Programming
We present PlasmidPL, a plasmid-inspired programming language designed for Genetic Programming (GP), and based on a chemical metaphor. The basic data structures in PlasmidPL are ci...
Lidia Yamamoto