Results 11 to 20 of about 82,016 (303)
A Meta-CSP Model for Optimal Planning [PDF]
, 2007 One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an increase in the size of the model to be solved.We introduce a ...
Fox, Maria, Gregory, Peter, Long, Derek
core +8 more sources
Additive Sparsification of CSPs
ACM Transactions on Algorithms, 2023 Multiplicative cut sparsifiers, introduced by Benczúr and Karger [STOC’96], have proved extremely influential and found various applications. Precise characterisations were established for sparsifiability of graphs with other 2-variable predicates on Boolean domains by Filtser and Krauthgamer [SIDMA’17] and non-Boolean domains by Butti and Živný [SIDMA’
Eden Pelleg, Stanislav Zivný
openaire +6 more sources
On Quadratic Threshold CSPs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Discrete Algorithms A predicate P: {-1, 1}k →{0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called ''approximation resistant'' if Max CSP(P) cannot be approximated better than the approximation obtained by choosing a random assignment, and ''approximable'' otherwise.
Per Austrin +2 more
openaire +5 more sources
On ADS-B Sensor Placement for Secure Wide-Area Multilateration
Proceedings, 2020 As automatic dependent surveillance–broadcast (ADS-B) becomes more prevalent, the placement of on-ground sensors is vital for Air Traffic Control (ATC) to control the airspace.
Ala’ Darabseh +3 more
doaj +1 more source
Automatically Generating CSP Models for Communicating Haskell Processes [PDF]
, 2009 Tools such as FDR can check whether a CSP model of an implementation is a refinement of a given CSP specification. We present a technique for generating such CSP models of Haskell implementations that use the Communicating Haskell Processes library.
Brown, Neil C.C.
core +1 more source
Sparsification of Binary CSPs [PDF]
SIAM Journal on Discrete Mathematics, 2020 Full version of a STACS'19 ...
Silvia Butti, Stanislav Zivný
openaire +7 more sources
, 1996 Security protocols are designed to meet particular security properties. In order to analyse such protocols formally, it is necessary to provide a formal definition of the property that they are intended to provide. This paper is concerned with the property of anonymity.
Steve A. Schneider, Abraham Sidiropoulos
openaire +2 more sources
Global review of CSP technologies [PDF]
, 2011 Includes abstract.This global review of concentrating solar power (CSP) technologies is based mainly on an assessment of available international literature, up to 31 October 2011.
Sikhosana, Qedile
core +1 more source
Modeling Robustness in CSPs as Weighted CSPs
, 2013 Many real life problems come from uncertain and dynamic environments, where the initial constraints and/or domains may undergo changes. Thus, a solution found for the problem may become invalid later. Hence, searching for robust solutions for Constraint Satisfaction Problems (CSPs) becomes an important goal.
Laura Climent +3 more
openaire +3 more sources
Yoruba Studies Review, 2022 Western missionaries, ethnographic and anthropological scholars arrived in Africa, quizzed the pre-colonial African, and adjudged her, pre-critical and pre-logical, since the latter could not disclose or express thoughts according to the dictates or ...
Emmanuel Ofuasia (csp)
doaj +1 more source