952 search results - page 49 / 191 » Computational complexity of stochastic programming problems |
157
click to vote
ATMOS
2007
15 years 7 months ago
2007
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...
193
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
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...
149
click to vote
MOR
2006
15 years 6 months ago
2006
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
183
click to vote
ICSOC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The modularity of Service-oriented Architectures (SOA) allows to establish complex distributed systems comprising e.g., services, clients, brokers, and workflow engines. ...
145
click to vote
EUROGP
2008
Springer
15 years 7 months ago
2008
Springer
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...