Results 11 to 20 of about 7,040,272 (244)
A study of encodings of constraint satisfaction problems with 0/1 variables [PDF]
, 2003 Many constraint satisfaction problems (csp's) are formulated with 0/1 variables. Sometimes this is a natural encoding, sometimes it is as a result of a reformulation of the problem, other times 0/1 variables make up only a part of the problem. Frequently
Selensky, E., Prosser, P.
core +9 more sources
A fuzzy constraint based model for bilateral multi-issue negotiations in semi-competitive environments [PDF]
, 2003 This paper develops a fuzzy constraint based model for bilateral multi-issue negotiation in trading environments. In particular, we are concerned with the principled negotiation approach in which agents seek to strike a fair deal for both parties, but ...
Luo, X. +4 more
core +2 more sources
Agricultural Water Management, 2023 Reasonable adjustment of crop acreage can improve the sustainability of agriculture in arid zones by promoting economic development, alleviating water scarcity, and improving resource utilization efficiency but meets the challenges of various decision ...
Hui Wu +4 more
doaj +1 more source
Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty Constraints
Applied Sciences, 2020 This paper considers the dynamic vehicle routing problem where a fleet of vehicles deals with periodic deliveries of goods or services to spatially dispersed customers over a given time horizon.
Grzegorz Bocewicz +3 more
doaj +1 more source
Extending Fuzzy Constraint Satisfaction Problems
Journal of Advanced Computational Intelligence and Intelligent Informatics, 2006 This paper propose a new type of Fuzzy CSP (Constraint Satisfaction Problem) that have a mixture of discrete and continuous domains, and a Spread-Repair algorithm. In traditional CSP and Fuzzy CSP, values for the variables are chosen from the discrete domains. However, this is often inconvenient when one wants to express real world problems.
Yasuhiro Sudo +2 more
openaire +2 more sources
Mathematics, 2019 Geometric programming problems are well-known in mathematical modeling. They are broadly used in diverse practical fields that are contemplated through an appropriate methodology.
Armita Khorsandi +2 more
doaj +1 more source
The Constraint Satisfaction Problem: Complexity and Approximability
, 2017 A backdoor set of a CSP instance is a set of variables whose instantiation moves the instance into a fixed class of tractable instances (an island of tractability).
Ordyniak, Sebastian +2 more
core +4 more sources
IEEE Access, 2020 In recent past, to meet the growing energy demand of electricity, integration of renewable energy resources (RESs) in an electrical network is a center of attention.
Muhammad Arsalan Ilyas +4 more
doaj +1 more source
An improved constraint satisfaction adaptive neural network for job-shop scheduling [PDF]
, 2010 Copyright @ Springer Science + Business Media, LLC 2009This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems.
Yang, S +11 more
core +1 more source
Fuzzy Evolutionary Approaches for Bus and Rail Driver Scheduling [PDF]
, 2002 Bus and train driver scheduling is a process of partitioning blocks of work, each of which is serviced by one vehicle, into a set of legal driver shifts.
Li, Jingpeng
core +7 more sources