A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Global Constraints in Distributed Constraint Satisfaction and Optimization
2013
Computer journal
Preserved Fulltext
We propose to include global constraints in distributed constraint satisfaction and optimization problems (DisCSPs and DCOPs). ...
We provide experimental evidence of the benefits of global constraints on several benchmarks, both for distributed constraint satisfaction and for distributed constraint optimization. selecting the values ...
The work of Ismel Brito, Patricia Gutierrez and Pedro Meseguer has been partially supported by the Spanish project TIN2009-13591-C02-02 and Generalitat de Catalunya 2009-SGR-1434. ...
doi:10.1093/comjnl/bxt088
fatcat:wtmfo7fxzfhi7k7rsidwqfyrhq
Distributed Constraint Programming with Agents
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Problems such as job shop scheduling have an intuitive matching between agents and machines. In distributed constraint problems, agents control variables and are connected via constraints. ...
Our experiments show that both global constraints and advanced search schemes are necessary to optimize job shop schedules using DisCSP. ...
We introduce advanced agents with global constraints, and advanced search to solve distributed constraint satisfaction problems (DisCSP), in particular distributed constraint optimization problems (DisCOP ...
doi:10.1007/978-3-642-23857-4_32
fatcat:52wh3lhgcvcylfiyfnx6qbx2nu
Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers
2009
Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The first one is constraint satisfaction on a single time interval, say one hour, which is common in practice. ...
We also address a global constraint problem, say over a full day. ...
This paper grew out of joint research with Sam Borst and Marty Reiman-their contribution and encouragement are greatly appreciated. ...
doi:10.1287/opre.1080.0651
fatcat:s4pbx2siujeodbdcb2vj7e557m
Distributed partial constraint satisfaction problem
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables that satis es all constraints ...
However, when real problems are formalized as distributed CSPs, they are often over-constrained and have no solution that satis es all constraints. ...
We have also presented the synchronous branch and bound and the iterative distributed breakout for solving distributed maximal constraint satisfaction problems, which belong to a very important class of ...
doi:10.1007/bfb0017442
fatcat:ipnnmyy5abhnloznmkjtsxhfry
Integrating multi-agent negotiation to resolve constraints in fulfilling supply chain orders
2006
Electronic Commerce Research and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The results show that the integrated system outperforms the existing distributed constraint satisfaction algorithms in various demand patterns. ...
The coordination of OFP among supply chain partners can be viewed as a distributed constraint satisfaction problem (DCSP). ...
-1-4), National Science Council (NSC92-2416-H-110-001), and Metal Industry Research and Development Center. ...
doi:10.1016/j.elerap.2006.04.003
fatcat:eprd5zpqfbfxrk6ce2h4dwpdzi
Stochastic networks for constraint satisfaction and optimization
1990
Sadhana (Bangalore)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Stochastic algorithms for solving constraint satisfaction problems with soft constraints that can be implemented on a parallel distributed network are discussed in a unified framework. ...
It is shown that the automata network and the MRF formulation can be regarded as generalisations of the Boltzmann machine in different directions. ...
Here our interest is in stochastic network-based solutions to such constraint satisfaction and optimization problems. ...
doi:10.1007/bf02811324
fatcat:pb7rk7ypujc2vcdhrtfnp6bnt4
SOS-Heuristic for Intelligent Exploration of Search Space in CSOP
[chapter]
2008
Tabu Search
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We seek in this work to develop a general approach of constraints satisfaction and optimization to ensure simultaneously the tasks of optimization and of constraints satisfaction. ...
We discuss and we conclude this work in section 7.
Constraint satisfaction or optimization process? ...
doi:10.5772/5597
fatcat:qou6v2x4ojeb3hqhevvzh3kgcm
Distributed Approach for QoS Service Selection in Web of Objects
2016
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For this purpose, we propose in this paper a distributed and optimal QoS services selection approach based on Multi-Agents paradigm and Distributed Constraints Optimization Formalism (DCOP). ...
The proposed algorithm takes into accounts the specificities of the service composition context and the satisfaction of the global user's constraints. ...
Hence, we proposed a distributed algorithm, the SynchBB4QoS, revisited from the Branch & Bound optimization technique to meet the need of optimization and satisfaction of global QoS user constraints. ...
doi:10.1016/j.procs.2016.04.240
fatcat:bjmhoeyiz5fazpc6oy4tugenbu
A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities
2007
International Journal of Information Technology and Web Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Many real-world problems can be viewed and represented as a constraint satisfaction problem (CSP). In addition, many of these problems are distributed in nature. ...
The overall goal is to make each PIA-Agent's network consistent and optimal. Each PIA-Agent is independent and has sole control over its network. ...
Although the global solution may not be optimal, we try to generate near optimal ones. Note that our distributed system is not centrally controlled. ...
doi:10.4018/jitwe.2007040102
fatcat:j4aztsealfdbxknflvfl7s5gmi
Distributed Model Predictive Safety Certification for Learning-based Control
2020
IFAC-PapersOnLine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In numerical simulations, we show that the safety framework ensures constraint satisfaction for an initially unsafe control policy and allows to improve overall control performance compared to robust distributed ...
Learning-based control algorithms offer promising opportunities to address this challenge, but generally cannot guarantee safety in terms of state and input constraint satisfaction. ...
However, learning-based controllers generally fail to guarantee safety in terms of state and input constraint satisfaction, because optimizing the control objective can lead to critical system states or ...
doi:10.1016/j.ifacol.2020.12.1205
fatcat:nmmqob3pxjc3dgtti6idueiqum
Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our proposal is rooted in the distributional maxmin fairness theory, which uses randomization to maximize the expected satisfaction of the worst-off individuals. ...
We study a novel problem of fairness in ranking aimed at minimizing the amount of individual unfairness introduced when enforcing group-fairness constraints. ...
The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. ...
arXiv:2106.08652v2
fatcat:g6wytj6pv5cq7c6sqf7tfax5pm
A Comparative Theoretical and Computational Study on Robust Counterpart Optimization: III. Improving the Quality of Robust Solutions
2014
Industrial & Engineering Chemistry Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study the solution quality of robust optimization problems when they are used to approximate probabilistic constraints and propose a novel method to improve the quality. ...
The effectiveness of the proposed method is illustrated through numerical examples and applications in planning and scheduling problems. ...
■ ACKNOWLEDGMENTS The authors gratefully acknowledge financial support from the National Science Foundation (CMMI-0856021) and the National Institute of Health (5R01LM009338). ...
doi:10.1021/ie501898n
pmid:25678740
pmcid:PMC4311936
fatcat:r3ztknmo7ndg3ewxb2cl2henve
Research on Green Technology Path of Cold-Chain Distribution of Fresh Products Based on Sustainable Development Goals
2022
Sustainability
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
While satisfying the freshness constraint, the results obtained by the particle swarm optimization algorithm reduce the total distribution cost by CNY 362 and improve customer satisfaction by 3.82%. ...
In order to meet customers' demand for freshness and the time window of fresh product distribution, and achieve the sustainable development of the fresh product cold-chain logistics industry, green technology ...
In other words, it has high customer satisfaction and low total distribution costs. ...
doi:10.3390/su142416659
fatcat:fh7axgoo6nhzbiu6almhbbv64m
Constraint satisfaction in incremental placement with application to performance optimization under power constraints
2007
2007 25th International Conference on Computer Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In the detailed placement stage, we develop a constraint-monitoring and satisfaction mechanism in a network (n/w) flow based detailed placement framework proposed recently, and empirically show its near-optimality ...
Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analytical global placement stage to solve the constrained optimization problem. ...
Our constraint-satisfaction method uses a Lagrangian Relaxation (LR) type approach in the global placement stage. ...
doi:10.1109/iccd.2007.4601910
dblp:conf/iccd/RenD07
fatcat:t7ioyd5ugbdhpgkwbqx3uf2wne
Nogood based asynchronous distributed optimization (ADOPT ng)
2006
Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems - AAMAS '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This work proposes an asynchronous algorithm for solving Distributed Constraint Optimization problems (DCOPs) using a new kind of nogoods, namely valued nogoods. ...
Valued nogoods are an extension of classic nogoods that associates each nogood with a threshold and optionally with a set of references to culprit constraints. ...
INTRODUCTION Distributed Constraint Optimization (DCOP) is a formalism that can model naturally distributed problems. ...
doi:10.1145/1160633.1160894
dblp:conf/atal/SilaghiY06
fatcat:5tm42uczafbrzhr2qqqthb7q4y
« Previous
Showing results 1 — 15 out of 78,950 results