Scientific Computation

Topics: optimal, tree, random, matrix, function, data, linear, algorithm, compute, solution, stock market,...

Advances In Feature Selection For Data And Pattern Recognition

Topics: data, feature, classification, attribute, algorithm, decision, rules, selection, set, attributes,...

Cognitive Dynamic Systems

Topics: cognitive, radar, spectrum, dynamic, vector, function, radio, estimation, network, bayesian,...

Essential Bioinformatics

Topics: sequence, protein, alignment, sequences, gene, prediction, database, structure, multiple, dna,...

An Introduction To Bioinformatics Algorithms

Topics: algorithm, dna, alignment, sequence, algorithms, problem, graph, vertex, vertices, gene, dynamic...

University of Illinois Urbana-Champaign

334
334

Mar 26, 2013
03/13

by
Adams, Harold Corwin; University of Illinois at Urbana-Champaign. Dept. of Computer Science

texts

#
eye 334

#
favorite 0

#
comment 0

Originally presented as the author's thesis (M.S.)--University of Illinois at Urbana-Champaign, 1971

Topics: OL/2 (Computer program language), Dynamic programming

40
40

Aug 27, 2019
08/19

by
Aris, Rutherford

texts

#
eye 40

#
favorite 0

#
comment 0

x, 148 p. 24 cm

Topic: Dynamic programming

87
87

Oct 5, 2015
10/15

by
Badal, Dusan Z.;Gehl, Michael T.

texts

#
eye 87

#
favorite 0

#
comment 0

"NPS-52-82-001"--Cover

Topic: DYNAMIC PROGRAMMING.,MATHEMATICAL OPTIMIZATION.

"NPS-52-82-001"--Cover

Topics: DYNAMIC PROGRAMMING., MATHEMATICAL OPTIMIZATION.

172
172

Jun 15, 2019
06/19

by
Bather, John

texts

#
eye 172

#
favorite 2

#
comment 0

ix, 191 p. : 23 cm

Topics: Decision making, Dynamic programming

4
4.0

Feb 16, 2022
02/22

by
Bellman, Richard, 1920-1984

texts

#
eye 4

#
favorite 2

#
comment 0

1 online resource (363 pages) :

Topics: Dynamic programming, Programmation (Mathématiques), Théorie des jeux, MATHEMATICS -- Applied,...

46
46

Dec 18, 2020
12/20

by
Bellman, Richard, 1920-1984

texts

#
eye 46

#
favorite 5

#
comment 0

xxv, 340 p. : 22 cm

Topic: Dynamic programming

18
18

Apr 12, 2021
04/21

by
Bellman, Richard, 1920-1984

texts

#
eye 18

#
favorite 1

#
comment 0

1 online resource (xv, 246 pages)

Topics: Dynamic programming, Algorithms, Graph theory, MATHEMATICS -- Linear & Nonlinear Programming,...

122
122

Nov 4, 2014
11/14

by
Bellman, Richard, 1920-1984; Dreyfus, Stuart E., joint author

texts

#
eye 122

#
favorite 2

#
comment 0

Includes bibliography

Topic: Dynamic programming

39
39

Feb 21, 2019
02/19

by
Bertsekas, Dimitri P

texts

#
eye 39

#
favorite 1

#
comment 0

xv, 397 p. : 24 cm

Topics: Dynamic programming, Stochastic processes

Counterdrug operations are of national interest to the U.S. and our allies because the illegal production and trafficking of drugs threatens U.S. national security and undermines security and stability in Latin America. Since law enforcement tasked with counterdrug operations is not given enough platforms to search every location at all times, they must decide how to employ their scarce platforms. To assist law enforcement, we develop a defender-attacker optimization model that utilizes...

Topics: Stochastic Optimization, Dynamic Programming, Defender-Attacker Optimization, Global Bender’s...

34
34

Jan 13, 2020
01/20

by
Boudarel, R. (Rene)

texts

#
eye 34

#
favorite 3

#
comment 0

xiv, 252 pages ; 24 cm

Topics: Programmation dynamique, Commande, Théorie de la, Control systems Design Optimisation methods...

7
7.0

Oct 5, 2020
10/20

by
Boudarel, R. (René)

texts

#
eye 7

#
favorite 2

#
comment 0

xiv, 252 pages ; 24 cm

Topics: Control theory, Dynamic programming, Dynamische Optimierung, Kontrolltheorie, Optimale Kontrolle,...

An increasingly dynamic battlefield requires increasingly faster software development. Cyber threats and Information Assurance certifications induce significant delays in software operational deployment designed to meet these emerging battlefield requirements. An alternative software development methodology for Department of Defense (DOD) acquisitions was proposed. The proposed software development methodology uses tailoring of commercial pre-approved applications such as Microsoft Office and...

Topics: Jamming, EA-18G, Linear Programming, Dynamic Programming, Microsoft Office, GPU, Radar, Bresenham...

5
5.0

May 11, 2020
05/20

by
Cairoli, R. (Renzo), 1931-1994

texts

#
eye 5

#
favorite 1

#
comment 0

xi, 327 pages ; 25 cm

Topics: Programmation dynamique, Arrêt optimal (Statistique mathématique), Stochastic processes,...

The fault location model under investigation consists of an n-component series system known to have exactly one failed component. Component positions in the system are taken as fixed. A component is either working or failed. Components work or fail independently of each other, with their a prior reliabilities taken as given but not necessarily equal. Group testing to locate the failed component is sequential, binary and dichotomous in nature with certain results. The only costs are the number...

Topics: Fault location model, Series system, Group testing, Information theory, Dynamic programming

Click here to view the University of Florida catalog record

Topics: Dynamic programming, Production planning

In an era of modernization, new weapons systems generate new manpower requirements for the airborne community within the United States Army. The problem of forecasting yearly requirements and inventories has become increasingly complex. This thesis formulates a methodology which applies the Markov Theory to manpower planning in order to forecast yearly inventories. It also discusses zhe strategy of dynamic programming in determining the optimal numbers of soldiers with certain skill levels and...

Topics: Management, manpower, forecasting, optimization, Markov, Dynamic Programming, airborne, SOI, CMF/MOS

Operational commanders and planners are challenged with maintaining fleet presence in many environments with limited resources. To add to this challenge, there are further constraints placed upon assets allocated to a given operational commander such as replenishments at sea, multinational exercises, diplomatic port visits, and predetermined in-chop and out-chop dates. In the case of the Combined Maritime Force (CMF), which operates in the FIFTH FLEET Area of Responsibility, these constraints...

Topics: Dynamic programming, Network analysis (Planning), Mathematical optimization

8
8.0

Jan 14, 2022
01/22

by
Cooper, Leon, 1924-

texts

#
eye 8

#
favorite 1

#
comment 0

ix, 289 p. : 26 cm

Topic: Dynamic programming

39
39

Aug 16, 2019
08/19

by
Danø, Sven

texts

#
eye 39

#
favorite 1

#
comment 0

164 p. : 24 cm

Topics: Dynamic programming, Nonlinear programming

21
21

Mar 19, 2021
03/21

by
Dao Phuong Nam, Nguyen Hong Quang, Tran Phuong Nam, Tran Thi Hai Yen

texts

#
eye 21

#
favorite 0

#
comment 0

In this paper, the optimal control problem of a nonlinear robot manipulator in absence of holonomic constraint force based on the point of view of adaptive dynamic programming (ADP) is presented. To begin with, the manipulator was intervened by exact linearization. Then the framework of ADP and Robust Integral of the Sign of the Error (RISE) was developed. The ADP algorithm employs Neural Network technique to tune simultaneously the actor-critic network to approximate the control policy and the...

Topics: Adaptive dynamic programming (ADP), Input constraint, Neural network, Robot manipulator, Robust...

The purpose of this research was to examine a number of existing mathematical models of repairable inventory systems in order to discover possible improvements and/or generalization of existing work in this area of research. The research resulted in two research reports. One deals with a deterministic model for a repairable item inventory system with a finite repair rate. The second report deals with managing repairable item inventory systems. The second paper presents a relatively...

Topics: DTIC Archive, Nahmias,Steven, PITTSBURGH UNIV PA DEPT OF INDUSTRIAL ENGINEERING, *MATHEMATICAL...

In this paper the two-dimensional pallet loading problem is considered: that is, the problem of loading a rectangular pallet of size 'L' by 'W', drawing from a set of 'n' rectangular boxes. The objective is to maximize the area covered on the pallet by the boxes loaded. The problem is approached using a combination of Dynamic Programming and heuristics. The structured solutions resulting from the application of the 'dynamic program' have two serendipitous characteristics: any item may be placed...

Topics: DTIC Archive, Hodgson,Thom J, FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING,...

We present an algorithmc model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumption on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We find that even under these potentially chaotic circumstances it is possible to solve several important classes of problems including...

Topics: DTIC Archive, Bertsekas,Dimitri P, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND...

This thesis presents a versatile initialization design for dynamic determination of physical resources in an adaptive manner for a multi-microprocessor environment. The design is general in nature and represents a structured, functional approach to the initialization process based on the use of dynamic resource mapping, knowledge passing between layered program components, and coordinated interprocessor communication. An implementation of this design is presented for initialization of the...

Topics: DTIC Archive, Baker,Gary Stewart, NAVAL POSTGRADUATE SCHOOL MONTEREY CA, *MULTIPROCESSORS,...

This report summarizes the results of a four year research effort. The primary research topic addressed is automatic shape recognition of silhouettes or contours. Methods studied are Fourier descriptors, Walsh descriptors, and 2-D moments. Also the recognition of partially correct shapes are addressed. Three methods were developed to solve such problems. These methods are (1) polygonal fitting of a boundary followed by local matching of distances and angles; (2) Fourier descriptor...

Topics: DTIC Archive, Mitchell,O R, PURDUE UNIV LAFAYETTE IN SCHOOL OF ELECTRICAL ENGINEERING, *IMAGE...

Several methods for computing good cross-country routes between map positions from information contained in map databases and other intelligence sources are evaluated. The problem of determining cross-country mobility from features gathered from map databases is addressed, with the goal of finding the optimal path between two positions on a map. (Author)

Topics: DTIC Archive, SMART SYSTEMS TECHNOLOGY INC MCLEAN VA, *MILITARY INTELLIGENCE, *TERRAIN, *ARTIFICIAL...

Our objective is to provide a more general theoretical basis for those methods for solving constrained minimization problems that are based on successive unconstrained minimizations of a parametric auxiliary function. In order to do this, we first give basic defining properties of a general auxiliary function and obtain a proof of local convergence for the mildly regulated nonconvex problem. We proceed from this general result to develop a family of auxiliary functions by giving the general...

Topics: DTIC Archive, Fiacco, Anthony V, NORTHWESTERN UNIV EVANSTON IL TECHNOLOGICAL INST, *MATHEMATICAL...

Recent work by the authors and others has demonstrated the connections between the dynamic programming approach to optimal control theory and to two-person, zero-sum differential games problems and the new notion of viscosity solutions of Hamilton-Jacobi PDE's introduced by M. G. Crandall and P. L. Lions. In particular, it has been proved that the dynamic programming principle implies that the value function is the viscosity solution of the associated Hamilton-Jacobi-Bellman and Isaacs...

Topics: DTIC Archive, Lions,P L, WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER, *Dynamic programming,...

We consider the problem of allocating a set of heterogeneous resources with availability constraints to maximize a given value function. The problem arises in a wide variety of military and industrial situations. We formulate the problem as a discrete- state decision process. We consider two instances of the problem that is applicable in situations where persistent coverage over all stages is desired. While we were able to solve the first example using dynamic programming, the computational...

Topics: DTIC Archive, Wu, Cynara C, ALPHATECH INC BURLINGTON MA, *RESOURCE MANAGEMENT, *DYNAMIC...

The Johns Hopkins University Applied Physics Laboratory has investigated the suitability of virtual machine technology for use in dynamic coalition networks. The remote creation and teardown of dynamic coalition networks among partners with different degrees of trustworthiness is a very desirable capability and poses a difficult challenge to implement. There are many issues to be addressed in developing such a coalition capability, especially considering the high degree of security that is...

Topics: DTIC Archive, Davis, Lauren B, JOHNS HOPKINS UNIV LAUREL MD APPLIED PHYSICS LAB, *DATA PROCESSING...

We consider the problem of collaborative target localization by several observers, called players, where the reliability of each player is unknown. As in our previous work [1] we formulate this problem as a 20 questions game with noise for collaborative players under a minimum entropy criterion. We extend the setting of [1] to the case where the players' error channels have unknown crossover probabilities. First, we use dynamic programming to characterize the structure of the optimal policy for...

Topics: DTIC Archive, MICHIGAN UNIV ANN ARBOR, *TARGETS, DYNAMIC PROGRAMMING, GAME THEORY, OPTIMIZATION,...

Biological control systems routinely guide complex dynamical systems through complicated tasks such as running or diving. Conventional control techniques, however, stumble with these problems, which have complex dynamics, many degrees of freedom, and a task which is often only partially specified. To address problems like these, we are using a biologically inspired, hierarchical control structure, in which controllers composed of radial basis function networks learn the controls required at...

Topics: DTIC Archive, Crawford, Lara S., CALIFORNIA UNIV BERKELEY, *ROBOTICS, *ARTIFICIAL INTELLIGENCE,...

In Olson, Wright, and McKell's recent paper on the design of oil pollution detection schedules, an interesting and inventive development and application of a Markov Decision Process was presented. Optimal schedules for patrol flights of surveillance aircraft were found using linear programming. In this paper the model has been reformulated as a discrete time semi-Markov process. Significant computational advantages accrue from this alternative approach. (Author)

Topics: DTIC Archive, Daniel,Lee E , Jr, FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS...

A system to lay out custom circuits that recognize regular languages can be a useful VLSI design automation tool. This paper describes the algorithms used in an implementation of a regular expression compiler. Layouts that use a network of programmable logic arrays (PLA's) have smaller areas than those of some other methods, but there are the problems of partitioning the circuit and then placing the individual PLA's. Regular expressions have a structure which allows a novel solution to these...

Topics: DTIC Archive, Trickey, Howard W., STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, *COMPUTER AIDED...

An enumeration algorithm which synthesizes programs from example computations is presented. The algorithm, originally proposed by Alan W. Biermann of Duke University, assigns a labelling of the instructions contained in an example trace consistent with producing minimum state Moore machine representations for the synthesized programs. Techniques for processing the information to reduce enumeration are given. Biermann's algorithm is extended by trace preprocessing techniques which identify and...

Topics: DTIC Archive, Lape,Joseph Shawn, NAVAL POSTGRADUATE SCHOOL MONTEREY CA, *COMPUTER AIDED DESIGN,...

SEQOPT has been designed to solve a specific force structuring and allocation problem. Given the following: A set of targets each with a relative value and an associated single shot kill probability; A set of launch points for weapons and the number of weapons allowed at each launch point; The payload types available for use in these weapons; The set of accessible targets for a weapon carrying each payload type from every launch point. SEQOPT will then determine the payload type for each weapon...

Topics: DTIC Archive, Copes, Wayne S, ARMY MATERIEL SYSTEMS ANALYSIS ACTIVITY ABERDEEN PROVING GROUND MD,...

TACTICAL AIRCRAFT MUST FREQUENTLY PERFORM COMPLEX SEQUENTIAL TASKS IN WHICH THEY RELY HEAVILY ON THE INTEGRATION OF SENSORY DATA TO ASSESS STATE AND MAINTAIN SITUATIONAL AWARENESS. IN MODERN SYSTEMS, THE CONTROL OF THE SENSORS' INFORMATION-GATHERING ACTIVITIES IS CRITICAL-OPTIMAL PERFORMANCE IS DESIRED. BUT THIS IS MADE DIFFICULT BY THE REQUIREMENTS TO CONTEND WITH SOPHISTICATED FLEXIBLE SENSORY ASSETS, AND VOLATILE, UNCERTAIN ENVIRONMENTS. THIS PAPER INTRODUCES THE SENSOR MANAGEMENT PROBLEM...

Topics: DTIC Archive, Malhotra, P., WRIGHT LAB WRIGHT-PATTERSON AFB OH, *AVIONICS, *RADAR TRACKING,...

Volume II provides documentation and user guide for the DYNEVAL (Dynamic Economic Values) Model. DYNEVAL uses Lagrange Dynamic Programming to chart through time the optimal trajectory of an economy which has either been disrupted in some way or in which value structures have been changed. (Author)

Topics: DTIC Archive, Pugh,George E, DECISION-SCIENCE APPLICATIONS INC ARLINGTON VA, *MANAGEMENT PLANNING...

Since October 1, 1979, research in Complexity Theory and Combinatorial Algorithms at the Department of Computer Science at the University of Illinois was supported by the Office of Naval Research. During this period of time, research work was carried out in the areas of Computational Complexity Theory, Scheduling Algorithms, Graph Algorithms, Dynamic Programming, and Fault- Tolerance Computing. We summarize here our accomplishments and our future plans, and we wish to request continued support...

Topics: DTIC Archive, Liu, C L, ILLINOIS UNIV AT URBANA DEPT OF COMPUTER SCIENCE, *ALGORITHMS,...

The adjoint and minimum principle for a partially observed diffusion can be obtained by differentiating the statement that a control u* is optimal. Using stochastic flows the variation in the cost resulting from a change in an optimal control can be computed explicitly. The technical difficulty is to justify the differentiation.

Topics: DTIC Archive, Baras, John S, MARYLAND UNIV COLLEGE PARK SYSTEMS RESEARCH CENTER, *OPTIMIZATION,...

Topics: DTIC Archive, RAND CORP SANTA MONICA CA, *DYNAMIC PROGRAMMING, *EQUATIONS, *INTEGRAL EQUATIONS,...

The paper describes general models of economic growth. An optimality criterion is formulated. It is shown that there exist optimal programs under weak, economically meaningful assumptions.

Topics: DTIC Archive, Brock, William A, CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER, *DYNAMIC...

Theoretical calculations are made of the natural modes and frequencies of small-amplitude sloshing of liquids in partially filled circular canals and spherical tanks. An integral-equation approach is used to analyze the circular canal for arbitrary depth of liquid. A similar approach for the spherical tank provides modes and frequencies for the nearly-full and half-full cases. These results, together with the known behavior of the nearly- empty tank, are used in conjunction with the trends...

Topics: DTIC Archive, Budiansky, Bernard, LOCKHEED MISSILES AND SPACE CO INC SUNNYVALE CA, *HYDRODYNAMICS,...