Filters








1,950 Hits in 5.3 sec

Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks [article]

Christopher D. Rosin
2014 arXiv   pre-print
We present ULSA, a novel stochastic local search algorithm for random binary constraint satisfaction problems (CSP).  ...  Unlike the best previous methods for these benchmarks, ULSA is a simple unweighted method that does not require dynamic adaptation of weights or penalties.  ...  Edge weights are maintained and adapted over long periods consisting of many iterations.  ... 
arXiv:1411.7480v1 fatcat:h6iaioluqrde5mo7knj43xyxpy

Solving Max-SAT as Weighted CSP [chapter]

Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex
2003 Lecture Notes in Computer Science  
We then solve Max-SAT instances using state-of-the-art algorithms for weighted Max-CSP, dedicated Max-SAT solvers and the state-of-the-art MIP solver CPLEX.  ...  We wanted to see how recent progress in the weighted CSP (WCSP) field could compete with other approaches in related fields.  ...  We would also like to thank Fadi Aloul and Jens Gramm for making their code available to us.  ... 
doi:10.1007/978-3-540-45193-8_25 fatcat:3bexqko4yvbpfdiexayiquqdqq

Bounds Arc Consistency for Weighted CSPs

M. Zytnicki, C. Gaspin, S. De Givry, T. Schiex
2009 The Journal of Artificial Intelligence Research  
, a new weighted local consistency specifically designed for WCSP with very large domains.  ...  Motivated by the resolution of an RNA gene localization problem inside large genomic sequences, and in the spirit of bounds consistency for large domains in crisp CSPs, we introduce soft bounds arc consistency  ...  Conclusions and Future Work We have presented here new local consistencies for weighted CSPs dedicated to large domains as well as algorithms to enforce these properties.  ... 
doi:10.1613/jair.2797 fatcat:odxrf4cq3fhojc4j3brkmw7654

Conflict history based search for constraint satisfaction problem

Djamal Habet, Cyril Terrioux
2019 Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing - SAC '19  
In this paper, we propose Conflict-History Search (CHS), a dynamic and adaptive branching heuristic for CSP solving.  ...  Branching heuristic is an important module in algorithms dedicated to solve Constraint Satisfaction Problems (CSP).  ...  As long as they do not appear in new conflicts, some constraints can have their weights unchanged for several search steps.  ... 
doi:10.1145/3297280.3297389 dblp:conf/sac/HabetT19 fatcat:apymtm3rjjbyhd5vhgbucbf4ze

Towards a Contract Service Provider Model for Virtual Assets and VASPs [article]

Thomas Hardjono, Alexander Lipton, Alex Pentland
2020 arXiv   pre-print
A given CSP community consisting of multiple CSP business entities (VASPs) form a contract domain which implement well-defined contract primitives, policies and contract-ledger.  ...  Our exploration is motivated by the need to seek alternative blockchain service-fee models that departs from the token-for-operations (gas fee) model for smart contracts found on many popular blockchain  ...  The CSP-A, CSP-C and CSP-D a common contract-ledger for domain CD2.  ... 
arXiv:2009.07413v2 fatcat:pygag635yjbkvomxyq3wdy5pau

Half-checking propagators [article]

Mikael Zayenz Lagerkvist, Magnus Rattfeldt
2020 arXiv   pre-print
A formal model for half-checking propagators is introduced, together with a detailed description of how to support such propagators in a constraint programming system.  ...  Three general directions for creating half-checking propagation algorithms are introduced, and used for designing new half-checking propagators for the cost-circuit constraint as examples.  ...  Acknowledgments Thanks to the anonymous reviewers of this paper, which helped improve and clarify many points and recommended additional references.  ... 
arXiv:2007.05423v1 fatcat:3iy54lln4vb27eii3byswyntr4

Privacy of Existence of Secrets: Introducing Steganographic DCOPs and Revisiting DCOP Frameworks [article]

Viorel D. Silaghi, Marius C. Silaghi, René Mandiau
2019 arXiv   pre-print
Here we give a direction to the efforts for structuring concepts in this area.  ...  As such, the understanding of the DCOP framework has been refined with the needs of the two communities, but sometimes without spelling the new assumptions formally and therefore making it difficult to  ...  The new nomenclature (1) is long and shorter versions can be obtained by selecting as defaults: X 6 =Utilitarian, X 5 =Public, X 4 =Open, X 3 =Domain, X 2 =Static, X 1 =Weighted.  ... 
arXiv:1902.05943v1 fatcat:6qbkwj2cwbhjfduuhuejc7ulji

In pursuit of the holy grail

E. Freuder
1996 ACM Computing Surveys  
The central part of the paper is dedicated to the description of main constraint satisfaction techniques and industrial applications.  ...  In the paper, we give a survey of constraint programming technology and its applications starting from the history context and interdisciplinary nature of CP.  ...  Both algorithms pick one variable at a time and look for a value for this variable making sure that the new assignment is compatible with values committed to so far.  ... 
doi:10.1145/242224.242304 fatcat:uugoyii6vrd4jhabyqi3jw6qcu

Soft arc consistency revisited

M.C. Cooper, S. de Givry, M. Sanchez, T. Schiex, M. Zytnicki, T. Werner
2010 Artificial Intelligence  
The incremental lower bounds produced by local consistency filtering are used for pruning inside Branch and Bound search.  ...  This leads to a new soft arc consistency method, called, Virtual Arc Consistency which produces improved lower bounds compared with previous techniques and which can solve submodular cost functions.  ...  Acknowledgements We would like to thank Arie Koster and Achemi Bennaceur for discussions on the OSAC lower bound and its relation, by duality, to the linear relaxation of the ILP formulation of weighted  ... 
doi:10.1016/j.artint.2010.02.001 fatcat:4eniod6dqzhtzp62vi5rztejme

The Role of Co-chaperones in Synaptic Proteostasis and Neurodegenerative Disease

Erica L. Gorenberg, Sreeganga S. Chandra
2017 Frontiers in Neuroscience  
These co-chaperones contain a conserved J domain through which they form a complex with heat shock cognate 70 (Hsc70), enhancing the chaperone's ATPase activity.  ...  CSPα is a synaptic vesicle protein known to chaperone the t-SNARE SNAP-25 and the endocytic GTPase dynamin-1, thereby regulating synaptic vesicle exocytosis and endocytosis.  ...  ELG is supported by a Gruber Fellowship.  ... 
doi:10.3389/fnins.2017.00248 pmid:28579939 pmcid:PMC5437171 fatcat:gzu27yssmvhnbfcb4ukjt7rkgu

NEURAghe

Paolo Meloni, Alessandro Capotondi, Gianfranco Deriu, Michele Brian, Francesco Conti, Davide Rossi, Luigi Raffo, Luca Benini
2018 ACM Transactions on Reconfigurable Technology and Systems  
This work presents NEURAghe, a flexible and efficient hardware/software solution for the acceleration of CNNs on Zynq SoCs.  ...  Thanks to our heterogeneous computing model, our platform improves upon the state-of-the-art, achieving a frame rate of 5.5 fps on the end-to-end execution of VGG-16, and 6.6 fps on ResNet-18.  ...  (TCDM) used to store activations and runtime data, a weight memory (WM) a weight DMA controller to move weights to the CSP (WDMA), an activation DMA to move activations in/out of the CSP (ADMA), a simple  ... 
doi:10.1145/3284357 fatcat:nsc2gkpjdbbghmz6wcbrwqhkla

NEURAghe: Exploiting CPU-FPGA Synergies for Efficient and Flexible CNN Inference Acceleration on Zynq SoCs [article]

Paolo Meloni, Alessandro Capotondi, Gianfranco Deriu, Michele Brian, Francesco Conti, Davide Rossi, Luigi Raffo, Luca Benini
2017 arXiv   pre-print
This work presents NEURAghe, a flexible and efficient hardware/software solution for the acceleration of CNNs on Zynq SoCs.  ...  Thanks to our heterogeneous computing model, our platform improves upon the state-of-the-art, achieving a frame rate of 5.5 fps on the end-to-end execution of VGG-16, and 6.6 fps on ResNet-18.  ...  (TCDM) used to store activations and runtime data, a weight memory (WM) a weight DMA controller to move weights to the CSP (WDMA), an activation DMA to move activations in/out of the CSP (ADMA), a simple  ... 
arXiv:1712.00994v1 fatcat:s2e2eaafpbcffnutlzktggcooe

Extracellular-peptide control of competence for genetic transformation in Streptococcus Pneumoniae

Jean-Pierre Claverys
2002 Frontiers in Bioscience  
The ABC-exporter operates as a dimer, and consists of three functional domains; an ATP-hydrolysing domain (ATP) providing energy for transport, a membrane domain that mediates translocation of the mature  ...  This dispensable gene encodes a high molecular weight penicillin-binding protein, with transpeptidase and glycosyltransferase domains (90) , (91) .  ... 
doi:10.2741/claverys pmid:12133809 fatcat:jhlj2n7vfjftrlp4yjccp63cni

Graphical Models: Queries, Complexity, Algorithms

Martin C. Cooper, Simon de Givry, Thomas Schiex, Markus Bläser, Christophe Paul
2020 Symposium on Theoretical Aspects of Computer Science  
co-domain (used in automated reasoning) to functions over finite domain variables and integer or real co-domains (usual in machine learning and statistics).  ...  We restrict ourselves to functions of discrete variables but try to cover a variety of models that are not always considered as "Graphical Models", ranging from functions with Boolean variables and Boolean  ...  Arc consistency and Unit Propagation in SAT are fundamental in efficient CSP and SAT provers. Adding messages (new unary functions) to the problem makes these unary functions increasingly tight.  ... 
doi:10.4230/lipics.stacs.2020.4 dblp:conf/stacs/CooperGS20 fatcat:rqyjypnqozd47frmaobbcpo5ei

New trends in constraint satisfaction, planning, and scheduling: a survey

Roman Barták, Miguel A. Salido, Francesca Rossi
2010 Knowledge engineering review (Print)  
One of the most important tasks for solving a real life problem is to represent the problem as a CSP, that is, in terms of variables, domains and constraints.  ...  Then, we present different formulations for the same problem to show that a CSP can be modeled in many different manners.  ...  Consistency techniques have a long tradition in CSP research. Below we introduce the most wellknown and widely used algorithms for binary CSPs.  ... 
doi:10.1017/s0269888910000202 fatcat:4n7bn7rnyjbifi3nkignhwe5uy
« Previous Showing results 1 — 15 out of 1,950 results