منابع مشابه
Solving Problems with Finite Test Sets
Every finite and every co-finite set of non-negative integers is decidable. This is true and it is not, depending on whether the set is given constructively. A similar constraint is applicable in language theory and many other fields. The constraint is usually understood and, hence, omitted. The phenomenon of a set being finite, but possibly undecidable, is, of course, a consequence of allowing...
متن کاملSolving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the uti l i ty of the system's performance. In [Dean and Boddy, 1988], we define a framework for constructing solutions to time-dependent planning problems, called expectation-driven iterative refinement. In this paper, we analyze and solve a moderately complex time-dependent planning problem involving path planning for a ...
متن کاملOn Solving Quickest Time Problems in Time-Dependent, Dynamic Networks
In this paper, a pseudopolynomial time algorithm is presented for solving the integral time-dependent quickest flow problem (TDQFP) and its multiple source and sink counterparts: the time-dependent evacuation and quickest transshipment problems. A more widely known, though less general version, is the quickest flow problem (QFP). The QFP has historically been defined on a dynamic network, where...
متن کاملSolving Real-Life Time-Tabling Problems
We will compare the performance of a Genetic Algorithm and Simulated Annealing on instances of difficult real-life Time-Tabling Problems. We will further explain how the performance can be increased significantly by applying a general and very effective genotype-to-phenotype decoding. Furthermore, we will contrast the performance of Lamarckian Learning to the performance of Baldwin Learning. Fi...
متن کاملA Finite Algorithm for Solving Infinite Dimensional Optimization Problems
We consider the general optimization problem (P ) of selecting a continuous function x over a σ -compact Hausdorff space T to a metric space A, from a feasible region X of such functions, so as to minimize a functional c on X. We require that X consist of a closed equicontinuous family of functions lying in the product (over T ) of compact subsets Yt of A. (An important special case is the opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1999
ISSN: 0028-0836,1476-4687
DOI: 10.1038/22001