Results 281 to 290 of about 69,786 (317)

Algorithms for Stochastic CSPs

2006
The Stochastic CSP (SCSP) is a framework recently introduced by Walsh to capture combinatorial decision problems that involve uncertainty and probabilities. The SCSP extends the classical CSP by including both decision variables, that an agent can set, and stochastic variables that follow a probability distribution and can model uncertain events beyond
Thanasis Balafoutis, Kostas Stergiou 0001   +1 more
openaire   +1 more source

CSP-OZ: A Combination of Object-Z and CSP

1997
In this paper we define a combination of Object-Z and CSP called CSP-OZ. The basic idea is to define a CSP-semantics for every Object-Z class. Special care is taken to capture the characteristics of input and output parameters properly and to preserve the expected refinement rules.
openaire   +1 more source

Techno-economic assessment of soiling losses in CSP and PV solar power plants: A case study for the semi-arid climate of Morocco

Energy Conversion and Management, 2022
Hicham Ghennioui, Azouzoute Alae, Abdellatif Ghennioui   +2 more
exaly  

Covering CSPs

2013 IEEE Conference on Computational Complexity, 2013
Irit Dinur, Gillat Kol
openaire   +2 more sources

?????????????????????????? csp-?????????????????? ?????? ???????????????????????????????? ?????????????? ?????????? ???????????????????????? ???????????????????? ??????????????

2008
In this paper the analysis of CSP conception implementation problem for intelligible data analysis by means of Constraint Logic Programming is presented and formal logical substantiation of effective control routine for constraints set is introduced on the base of example data from oil&gas subject domain.
openaire   +1 more source

Simultaneous design and operational optimization of hybrid CSP-PV plants

Applied Energy, 2023
Marco Binotti
exaly  

Cost reduction potential in parabolic trough collector based CSP plants: A case study for India

Renewable and Sustainable Energy Reviews, 2021
Tarun Kumar Aseri, Chandan Sharma
exaly  

Solving Dynamic CSPs

2004
Constraint Satisfaction problems (CSPs) are a fundamental concept used in many real world applications such as frequency assignment, configuration and conceptual design, scheduling and planning. A main challenge when designing a CSP-based system is the ability to deal with constraints in a dynamic and evolutive environment.
openaire   +1 more source

Does A Virtuous Circle Really Exist? Revisiting the Causal Linkage Between CSP and CFP

Journal of Business Ethics, 2021
Audrey Murrell, Xiaoping Zhao, Zhao Xiaoping   +2 more
exaly  

Mobile CSP

2016
Jim Woodcock 0001, Andy J. Wellings, Ana Cavalcanti 0001   +2 more
openaire   +1 more source