1984 search results - page 36 / 397 » The colourful feasibility problem |
IPCO
2010
13 years 8 months ago
2010
In the classical secretary problem an employer would like to choose the best candidate among
NETWORKS
2010
13 years 8 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
QSHINE
2005
IEEE
14 years 3 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
WG
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...