Search

Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem

REA Auditado

The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. This problem was first introduced by Grenander and brought to computer science by Bentley in 1984. This problem has been branched out into other problems based on their characteristics. k-overlapping maximum subarray problem where the overlapping solutions are allowed, and k-disjoint maximum subarray problem where all the solutions are disjoint from each other are those.

Tema: general: 

• Ciencias

Nonreal eigenvalues for second order differential operators on networks with circuits

REA Auditado

Tema: general: 

• Ingeniería y Ciencias Aplicadas›Matemáticas y Física aplicadas

Model rocket workshop : a Problem-Based Learning experience for engineering students

REA Auditado

A Problem-Based Learning (PBL) experience for
undergraduate students of aerospace engineering is described in this paper. The experience allows the students to build a model rocket using materials which can be easily obtained. They also compute all the relevant quantities to design and characterize the rocket and they test the
robustness of their design. They furthermore launch the rocket with the corresponding payload and verify the flight parameters using an on-board altimeter. Finally, they also compare the flight parameters with the theoretically expected values.

Tema: general: 

• Ciencias

18.152 Introduction to Partial Differential Equations, Fall 2004

REA Auditado

This course analyzes initial and boundary value problems for ordinary differential equations and the wave and heat equation in one space dimension. It also covers the Sturm-Liouville theory and eigenfunction expansions, as well as the Dirichlet problem for Laplace's operator and potential theory.

Tema: general: 

• Ciencias›Matemáticas

Maximum-entropy principle approach to the multiple travelling salesman problem and related problems

REA Auditado

This thesis presents an investigation into the applications of the maximum-entropy principle as a heuristic for the multiple travelling salesman problem. This is a computationally complex problem which requires special treatment by conventional optimization techniques. Specific focus is given to developing a generalized framework for this problem that can be applied to any number of variants on the basic formulation.

Tema: general: 

• Ingeniería y Ciencias Aplicadas›Ingeniería›Ingeniería Mecánica

A CONVERGENCE RESULT FOR ASYNCHRONOUS ALGORITHMS AND APPLICATIONS

REA Auditado

Abstract We give in this paper a convergence result concerning parallel asynchronous algorithm with bounded delays to solve a nonlinear fixed point problems. This result is applied to calculate the solution of a strongly monotone operator. Special cases of these operators are used to solve some problems related to convex analysis like minimization of functionals, calculus of saddle point and variational inequality problem.

Tema: general: 

• Ciencias›Matemáticas

The development of algorithms in mathematical programming

REA Auditado

In this thesis some problems in mathematical programming have been
studied. Chapter 1 contains a brief review of the problems studied
and the motivation for choosing these problems for further investigation.
The development of two algorithms for finding all the vertices of a
convex polyhedron and their applications are reported in Chapter 2.
The linear complementary problem is studied in Chapter 3 and an
algorithm to solve this problem is outlined.
Chapter 4 contains a description of the plant location problem
(uncapacited).

Tema: general: 

• Ciencias›Matemáticas

Relaxations of semiring constraint satisfaction problems

REA Auditado

The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework preferences can be associated with tuples of values of the variable domains. Bistarelli et al. [S. Bistarelli, U. Montanari, F. Rossi, Semiring-based constraint solving and optimization, Journal of the ACM 44 (2) (1997) 201–236] defines a maximal solution to a SCSP as the best set of solution tuples for the variables in the problem.

Tema: general: 

• Ingeniería y Ciencias Aplicadas›Ingeniería›Ingeniería (General)

Finite difference methods for singularly perturbed problems on non-rectangular domains

REA Auditado

Singularly perturbed problems arise in many branches of science and are characterised mathematically by the presence of a small parameter m u ltip ly in g one or more of the highest derivatives in a differential equation. This thesis concerns singularly perturbed problems posed on non-rectangular domains. The methodology used is to perform a co-ordinate transformation to pose the problem on a rectangular domain and to then study the transformed problem. We first consider a class of parabolic problems.

Tema: general: 

• Ciencias›Matemáticas

Methods for eigenvalue problems with applications in model order reduction

REA Auditado

Physical structures and processes are modeled by dynamical systems in a wide range of application areas. The increasing demand for complex components and large structures, together with an increasing demand for detail and accuracy, makes the models larger and more complicated. To be able to simulate these large-scale systems, there is need for reduced-order models of much smaller size, that approximate the behavior of the original model and preserve the important characteristics.

Tema: general: 

• General