Cerca risorse accademiche

Materie / parole chiave: RUSSELL, BERTRAND, 1872-1970; OXFORD UNIVERSITY PRESS; 121 R961p

Materie / parole chiave: HARDWICK, PHILIP; LONGMAN; 331.1372 H267p

Materie / parole chiave: ROSENBERG, JEROME L; MCGRAW-HILL; 540.7 R813s6

Materie / parole chiave: CATHEY, JIMMIE J; MCGRAW-HILL BOOK COMPANY; 621.3815 C363t

Materie / parole chiave: SMITH, WALLACE; UNIVERSITY OF CALIFORNIA PRESS; 307.1416 S642u

Materie / parole chiave: MILLS, EDWIN; THE PRESIDENT AND FELLOWS OF HARVARD COLLEGE; 304.6519 M657u

Materie / parole chiave: TAIT, ALAN A; INTERNATIONAL MONETARY FUND; 336.271 T135v

Materie / parole chiave: UNITED NATIONS; 341.733 N118vp

Materie / parole chiave: MCMILLAN, CAROL; PRINCETON UNIVERSITY PRESS; 305.42 M478w

In this paper, we present an algorithm inspired on the T-Cell model of the immune system, i.e., an artificial immune system (AIS). The proposed approach (called DTC) is intented to solve dynamic optimiza- tion problems. ...

In many applications oftemporal reasoning is necessary to express metric and symbolic temporal constraints among temporal objects whether they are points or intervals. In order to cope with these requirements different f...

In many critical real world classification problems one of the classes has much less samples than the others (class imbalance). In a previous work we introduced the REPMAC algorithm to solve imbalanced problems. Using a ...

Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., the Traveling Salesman Problem). In this report we describe an Ant System algorithm, which would be app...

The study of earliness and tardiness penalties in scheduling is a relatively recent area of research. In the past, traditionally the emphasis was put on regular measures that are nondecreasing in job completion times suc...

The choice of a search algorithm can play a vital role in the success of a scheduling application. Evolutionary algorithms (EAs) can be used to solve this kind of combinatorial optimization problems. Compared to conventi...

This paper presents a hybrid method to solve hard multi- objective problems. The proposed approach adopts an epsilon-constraint method which uses a Particle Swarm Optimizer to get points near of the true Pareto front. In...

Parallel machine scheduling, also known as parallel task scheduling, involves the assignment of multiple tasks onto the system architecture’s processing components (a bank of machines in parallel). A basic model invol...

In dynamic scheduling arrival times as well as some or all job attributes are unknown in advance. Dynamism can be classified as partial or total. In simplest partially dynamic problems the only unknown attribute of a jo...

It is known that the Minimum Weight Triangulation problem is NP-hard. Also the complexity of Minimum Weight Pseudo-Triangulation problem is unknown, suspecting that it is also a NP-hard problem. Therefore we focused on ...

Discrete combinatorial problems can be solved with Constraint Programming (CP) as long as they are formulated as Constraint Satisfaction Problems (CSP). In this paper we propose an object oriented model to solve combinat...

1. While teaching statistics to ecologists, the lead authors of this paper have noticed common statistical problems. If a random sample of their work (including scientific papers) produced before doing these courses were...

Having developed multiobjective optimization algorithms using evolutionary optimization methods and demonstrated their niche on various practical problems involving mostly two and three objectives, there is now a growing...

In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topol...

This book, first published in 2002, contains an introduction to hyperbolic partial differential equations and a powerful class of numerical methods for approximating their solution, including both linear problems and non...