8 research outputs found

    Special issue on computational tradeoffs under bounded resources

    Get PDF

    Master Index—Volumes 121–130

    Get PDF

    On Completeness of Cost Metrics and Meta-Search Algorithms in \$-Calculus

    Full text link
    In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete (Diagonalization complete) and H-complete (Hypercomputation complete) classes. We started the population process of these new classes. We justify that some super-Turing models of computation, i.e., models going beyond Turing machines, are tremendously expressive and they allow to accept arbitrary languages over a given alphabet including those undecidable ones. We prove also that one of such super-Turing models of computation -- the \$-Calculus, designed as a tool for automatic problem solving and automatic programming, has also such tremendous expressiveness. We investigate also completeness of cost metrics and meta-search algorithms in \$-calculus

    Learning dynamic algorithm portfolios

    Get PDF
    Algorithm selection can be performed using a model of runtime distribution, learned during a preliminary training phase. There is a trade-off between the performance of model-based algorithm selection, and the cost of learning the model. In this paper, we treat this trade-off in the context of bandit problems. We propose a fully dynamic and online algorithm selection technique, with no separate training phase: all candidate algorithms are run in parallel, while a model incrementally learns their runtime distributions. A redundant set of time allocators uses the partially trained model to propose machine time shares for the algorithms. A bandit problem solver mixes the model-based shares with a uniform share, gradually increasing the impact of the best time allocators as the model improves. We present experiments with a set of SAT solvers on a mixed SAT-UNSAT benchmark; and with a set of solvers for the Auction Winner Determination proble

    Heurísticas para el control deliberativo en una arquitectura de agentes inteligentes de tiempo real

    Full text link
    El área de la Inteligencia Artificial está experimentado un gran avance en los últimos tiempos con su aplicación a un mayor número de campos diferentes. Uno de ellos es el de los problemas de tiempo real. Problemas donde no sólo es importante la lógica del cálculo de las soluciones, sino también el instante de tiempo en que son calculadas dichas soluciones. Este acercamiento entre ambas árear es, en principio, provechoso, pues la Inteligencia Artificial puede aportar nuevas posibilidades a los sistemas de tiempo real, como una mayor flexibilidad de adaptación a entornos complejos y dinámicos. Sin embargo esta aproximación ha presentado desde siempre importantes dificultades. Principalmente los sistemas de tiempo real poseen unos requerimientos temporales (predecibilidad de los tiempos de respuesta principalmente) que no suelen ser habituales en las técnicas de Inteligencia Artificial. Entre otras formas de abordar este problema, está el desarrollo de arquitecturas software para el diseño de agentes inteligentes para su uso en entornos de tiempo real. Estas arquitecturas poseen diferentes mecanismos para que los agentes construidos puedan trabajar en entornos de tiempo real . Estas arquitecturas poseen diferentes mecanismos para que los agentes construidos puedan trabajas en entornos de tiempo real ofreciendo comportamientos reactivos (para cumplir los requerimientos temporales) y deliberativos (que hacen uso de técnicas de Inteligencia Artificial para conseguir mejores prestaciones). Una de estas arquitecturas es ARTIS. Esta arquitectura hace uso de una planificación de sus tareas a dos niveles para conseguir complir sus objetivos. Por un lado un planificador de primer nivel garantiza la obtención de respuestas dentro de límites temporales estrictos. Un planificador de segundo nivel se encarga del control de componentes que mejoran la calidad de los resultados. El trabajo presentado se centra en este segundo planificador, desarrollando dos heurísticas, SSS.......Hérnandez López, L. (2004). Heurísticas para el control deliberativo en una arquitectura de agentes inteligentes de tiempo real [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/2671Palanci

    A framework for knowledge discovery within business intelligence for decision support

    Get PDF
    Business Intelligence (BI) techniques provide the potential to not only efficiently manage but further analyse and apply the collected information in an effective manner. Benefiting from research both within industry and academia, BI provides functionality for accessing, cleansing, transforming, analysing and reporting organisational datasets. This provides further opportunities for the data to be explored and assist organisations in the discovery of correlations, trends and patterns that exist hidden within the data. This hidden information can be employed to provide an insight into opportunities to make an organisation more competitive by allowing manager to make more informed decisions and as a result, corporate resources optimally utilised. This potential insight provides organisations with an unrivalled opportunity to remain abreast of market trends. Consequently, BI techniques provide significant opportunity for integration with Decision Support Systems (DSS). The gap which was identified within the current body of knowledge and motivated this research, revealed that currently no suitable framework for BI, which can be applied at a meta-level and is therefore tool, technology and domain independent, currently exists. To address the identified gap this study proposes a meta-level framework: - ‘KDDS-BI’, which can be applied at an abstract level and therefore structure a BI investigation, irrespective of the end user. KDDS-BI not only facilitates the selection of suitable techniques for BI investigations, reducing the reliance upon ad-hoc investigative approaches which rely upon ‘trial and error’, yet further integrates Knowledge Management (KM) principles to ensure the retention and transfer of knowledge due to a structured approach to provide DSS that are based upon the principles of BI. In order to evaluate and validate the framework, KDDS-BI has been investigated through three distinct case studies. First KDDS-BI facilitates the integration of BI within ‘Direct Marketing’ to provide innovative solutions for analysis based upon the most suitable BI technique. Secondly, KDDS-BI is investigated within sales promotion, to facilitate the selection of tools and techniques for more focused in store marketing campaigns and increase revenue through the discovery of hidden data, and finally, operations management is analysed within a highly dynamic and unstructured environment of the London Underground Ltd. network through unique a BI solution to organise and manage resources, thereby increasing the efficiency of business processes. The three case studies provide insight into not only how KDDS-BI provides structure to the integration of BI within business process, but additionally the opportunity to analyse the performance of KDDS-BI within three independent environments for distinct purposes provided structure through KDDS-BI thereby validating and corroborating the proposed framework and adding value to business processes.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

    Special issue on computational tradeoffs under bounded resources

    No full text
    corecore