Now showing items 1-10 of 12
A FAST ALGORITHM ON AVERAGE FOR ALL-AGAINST-ALL SEQUENCE MATCHING
(IEEE TECHNICAL COMMITTEE ON DATA ENGINEERING, 1999)
We present an algorithm which attempts to align pairs of subsequences from a database of genetic sequences. The algorithm simulates the classical dynamic programming alignment algorithm over a suffix array of the database. ...
ENUMERATION STRATEGIES IN CONTRAINT PROGRAMMING FOR SOLVING PUZZLES
(IEEE COMPUTER SOCIETY, 2007)
Constraint programming is one of the major contributions of computer science for solving problems of high complexity. This paradigm is used to represent a wide variety of problems that can be modeled like constraint ...
A NEW STRATEGY BASED ON GRASP TO SOLVE A MACRO MINE PLANNING
In this paper we introduce a greedy randomized adaptive search procedure(GRASP) algorithm for solving a copper mine planning problem. In the last 10 years this real-world problem has been tackled using linear integer ...
Parameterized modal analysis using DIgSILENT Programming Language
(Springer International PublishingSpringer International Publishing, 2014)
A parameterized modal analysis is proposed to evaluate power system small signal stability and a simulation procedure using DIgSILENT Programming Language (DPL) is presented for this purpose. Modal analysis, or small-signal ...
DESIGN OF AN URBAN SOLID WASTE TRANSPORT SYSTEM
(UNIVERSIDAD COMPLUTENSE, 2002)
The objective of this article is to present the design of a non-hazardous solid waste collection system in an urban context. The system is formed by three activities: optimal location of transference centers, optimal ...
Comparison of Communication/Synchronization Models in Parallel Programming on Multi-Core Cluster
(Editorial de la Universidad Nacional de La Plata (EDULP), 2011)
AN OVERVIEW OF TURNPIKE THEORY: TOWARDS THE DISCOUNTED DETERMINISTIC CASE
In the last 5 years, there has been extensive work on the existence and characterization of solutions of undiscounted optimal programs in simple discrete-time models of the ‘choice of technique’ in development planning and ...
A BRANCH AND CUT ALGORITHM FOR SHEDULING THE HIGHLY-CONSTRAINED CHILEAN SOCCER TOURNAMENT
The qualifying phase of the Chilean soccer championship follows the structure of a compact single round robin tournament. Good schedules are of major importance for the success of the tournament, making them more balanced, ...
UNCERTAINTY IN FOREST PRODUCTION PLANNING
The forest harvest and road construction planning problem consists fundamentally of managing land designated for timber production and divided into harvest cells. For each time period, the planner must decide which cells ...
A NEW WAY OF NATURAL OLIGOPEPTIDE PRIMARY STRUCTURE ELUCIDATION
For more than a century, natural oligopeptides have attracted scientific attention as important biochemical regulators. Since that time, thousands natural oligopeptide regulators have been described, and now ~600 new natural ...