Search

Showing total 2 results
Start Over Search Limiters Peer Reviewed Topic linear programming
2 results

1. On the computability of agent-based workflows

Author

Prashant Palvia, David Paper, and Wai Yin Mok

Subjects
Information Systems and Management, Dependency (UML), Linear programming, Computer science, business.industry, Computability, Petri net, Management Information Systems, Workflow technology, Workflow, Arts and Humanities (miscellaneous), Developmental and Educational Psychology, Artificial intelligence, State diagram, Software engineering, business, Workflow management system, Information Systems
Abstract

Workflow research is commonly concerned with optimization, modeling, and dependency. In this research, we however address a more fundamental issue. By modeling humans and machines as agents and making use of a theoretical computer and statecharts, we prove that many workflow problems do not have computer-based solutions. We also demonstrate a sufficient condition under which computers are able to solve these problems. We end by discussing the relationships between our research and Petri Nets, the multi-agent framework in the literature, linear programming and workflow verification.

Published
2006

2. A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks

Author

Grit Claßen, Arie M. C. A. Koster, David Coudert, Napoleão Nepomuceno, Lehrstuhl II für Mathematik, Rheinisch-Westfälische Technische Hochschule Aachen (RWTH), Algorithms, simulation, combinatorics and optimization for telecommunications (MASCOTTE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Institut for Matematik og Datalogi (IMADA), Syddansk Universitet, This paper results from a research cooperation which was promoted by the PROCOPE program, a bilateral program funded by the German Academic Exchange Service with funds of the BMBF and by the French Ministry of Foreign Affairs. Additionally, this work has been supported by ANR DIMAGREEN and ECOSCELLS, the PATHFINDER project, Région PACA, and SME 3ROAM as well as the excellence initiative of the German federal and state governments and by the UMIC Research Centre at RWTH Aachen University. The for, Rheinisch-Westfälische Technische Hochschule Aachen University (RWTH), Université Nice Sophia Antipolis (1965 - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
Mathematical optimization, 021103 operations research, Linear programming, Computer science, Separation (aeronautics), 0211 other engineering and technologies, 020206 networking & telecommunications, Polytope, 02 engineering and technology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Wireless broadband, 0202 electrical engineering, electronic engineering, information engineering, Integer programming, Communication channel, Integer (computer science)
Abstract

International audience; In this paper, we propose a chance-constrained mathematical program for fixed broadband wireless networks under unreliable channel conditions. The model is reformulated as integer linear program and valid inequalities are derived for the corresponding polytope. Computational results show that by an exact separation approach the optimality gap is closed by 42% on average.; Dans cet article, nous proposons une modélisation en programme mathématique de type "chance-constrained" de réseaux de collecte à faisceaux hertziens avec conditions de transmissions non fiables. Le modèle est reformulé sous forme de programme linéaire en nombres entiers. Des inégalités valides sont générées à partir du polytope correspondant. Les résultats numériques montrent que l'approche par séparation exacte fourni un écart à l'optimal de 42% en moyenne.

Published
2011