5 results
Search Results
2. OPTIMIZATION OF BOUNDS IN TEMPORAL FLEXIBLE PLANS WITH DYNAMIC CONTROLLABILITY.
- Author
-
WAH, BENJAMIN W. and XIN, DONG
- Subjects
- *
MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS , *SIMULATION methods & models , *ALGORITHMS - Abstract
A temporal flexible planning problem that involves contingent and requirement events can be formulated as a simple temporal network with uncertainty (STNU). An STNU is controllable when there is a strategy for executing the requirement events (or actions) in such a way that all the conditions involving contingent events can be satisfied in all situations. The most interesting and useful controllability property is dynamic controllability in which the remaining actions in an STNU can always be scheduled under all possible feasible durations of future contingent events when all the past contingent events are known. In this paper, we propose and study a novel problem of assigning bounds on the duration of each requirement link in order for the resulting STNU to be dynamically controllable and to minimize the total cost over the allowed durations of all requirement links. We first prove the NP hardness of the problem with a linear cost function. We then formulate the dynamic controllability of an STNU as the constraints in a nonlinear optimization problem. Finally, we present methods for reducing the number of constraints in order to make the problem tractable and to demonstrate the computational performance of our methods. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
3. REDUCING THE TIME COMPLEXITY OF THE N-QUEENS PROBLEM.
- Author
-
El-Qawasmeh, Eyas and Al-Noubani, Khader
- Subjects
- *
ALGORITHMS , *ALGEBRA , *NUMERICAL analysis , *MATHEMATICAL analysis , *MATHEMATICS , *ASYMPTOTIC expansions - Abstract
This paper presents a fast algorithm for solving the n-queens problem. The basic idea of this algorithm is to use pre-computed solutions in 75% of the cases, while the remaining cases are solved by calling the Sosic's algorithm. The novelty of this algorithm is in the observation that these pre-computable cases exhibit a modular nature. In addition, the pre-computed solutions run 100 times faster than Sosic's algorithm in most cases. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
4. AUTOMATIC KERNEL REGRESSION MODELLING USING COMBINED LEAVE-ONE-OUT TEST SCORE AND REGULARISED ORTHOGONAL LEAST SQUARES.
- Author
-
HONG, X., CHEN, S., and SHARKEY, P. M.
- Subjects
- *
REGRESSION analysis , *MATHEMATICAL analysis , *MATHEMATICS , *MATHEMATICAL models , *MATHEMATICAL statistics , *ALGORITHMS , *NONLINEAR statistical models - Abstract
This paper introduces an automatic robust nonlinear identification algorithm using the leave-one-out test score also known as the PRESS (Predicted REsidual Sums of Squares) statistic and regularised orthogonal least squares. The proposed algorithm aims to achieve maximised model robustness via two effective and complementary approaches, parameter regularisation via ridge regression and model optimal generalisation structure selection. The major contributions are to derive the PRESS error in a regularised orthogonal weight model, develop an efficient recursive computation formula for PRESS errors in the regularised orthogonal least squares forward regression framework and hence construct a model with a good generalisation property. Based on the properties of the PRESS statistic the proposed algorithm can achieve a fully automated model construction procedure without resort to any other validation data set for model evaluation. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
5. RECONSTRUCTING DIFFERENTIAL EQUATION FROM A TIME SERIES.
- Author
-
Petrov, Valko, Kurths, Juergen, and Georgiev, Nikola
- Subjects
- *
DIFFERENTIAL equations , *NOISE , *TIME series analysis , *MATHEMATICAL analysis , *MATHEMATICS , *ALGORITHMS - Abstract
This paper treats a problem of reconstructing ordinary differential equation from a single analytic time series with observational noise. We suppose that the noise is Gaussian (white). The investigation is presented in terms of classical theory of dynamical systems and modern time series analysis. We restrict our considerations on time series obtained as a numerical analytic solution of autonomous ordinary differential equation, solved with respect to the highest derivative and with polynomial right-hand side. In case of an approximate numerical solution with a rather small error, we propose a geometrical basis and a mathematical algorithm to reconstruct a low-order and low-power polynomial differential equation. To reduce the noise the given time series is smoothed at every point by moving polynomial averages using the least-squares method. Then a specific form of the least-squares method is applied to reconstruct the polynomial right-hand side of the unknown equation. We demonstrate for monotonous, periodic and chaotic solutions that this technique is very efficient. [ABSTRACT FROM AUTHOR]
- Published
- 2003
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.