95 search results - page 6 / 19 » Solving Large-Scale Nonlinear Programming Problems by Constr... |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
AAAI
2007
13 years 10 months ago
2007
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
MP
2007
13 years 7 months ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
CONSTRAINTS
1999
13 years 7 months ago
1999
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
AUTOMATICA
2010
13 years 7 months ago
2010
This paper presents three novel Moving Horizon Estimation (MHE) methods for discrete-time partitioned linear systems, i.e. systems decomposed into coupled subsystems with non-over...