952 search results - page 113 / 191 » Computational complexity of stochastic programming problems |
233
click to vote
ICDT
2009
ACM
16 years 3 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
133
click to vote
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
125
click to vote
ISMB
1994
15 years 4 months ago
1994
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
108
click to vote
ICPR
2006
IEEE
15 years 9 months ago
2006
IEEE
We investigated the geometrical complexity of several high-dimensional, small sample classification problems and its changes due to two popular feature selection procedures, forw...
124
click to vote
ML
2002
ACM
15 years 2 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...