10,359 Hits in 2.9 sec

Guided Test Generation from CSP Models [chapter]

Sidney Nogueira, Augusto Sampaio, Alexandre Mota
Lecture Notes in Computer Science  
More generally, we characterise a testing theory in terms of CSP: test models, test purposes, test cases, test execution, test verdicts and soundness are entirely defined in terms of CSP processes and  ...  We introduce an approach for the construction of feature test models expressed in the CSP process algebra, from use cases described in a controlled natural language.  ...  Acknowledgements We would like to thank the feedback from the IFIP WG 2.3, from the UK Motorola Labs, and from the members of the CIn-BTC Research Project.  ... 
doi:10.1007/978-3-540-85762-4_18 fatcat:f55rxjlyl5hk5g7icnitz4yp2m

Guided complete search for nurse rostering problems

K.L. Spencer, Fung Ho-fung Leung, J.H.M. Lee
2005 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)  
In general, it consists of cardinality constraints and special pattern constraints that correspond to the given workforce demands, which form a complex problem structure.  ...  Acknowledgements The work described in this paper was partially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CUHK4211/01E).  ...  Experiments are conducted on the selected test cases from [5] , which are shown extremely difficult to solve by a general CSP solver.  ... 
doi:10.1109/ictai.2005.70 dblp:conf/ictai/FungLL05 fatcat:ksv3rjqszzcd3mv7jes54u2iuu

Neural Networks to Guide the Selection of Heuristics within Constraint Satisfaction Problems [chapter]

José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos
2011 Lecture Notes in Computer Science  
Hyper-heuristics are methodologies used to choose from a set of heuristics and decide which one to apply given some properties of the current instance.  ...  The first step in our approach requires to generate a pattern that maps any given instance, expressed in terms of constraint density and tightness, to one adequate heuristic.  ...  [25] proved that for every general CSP there is an equivalent binary CSP. Thus, all general CSPs can be reduced into a binary CSP.  ... 
doi:10.1007/978-3-642-21587-2_27 fatcat:nzorknconfco7fk7hcgvdhfscm

I-BiDaaS - D2.2: The Data Fabrication Platform (DFP, Interim version)

Omer Boehm
2018 Zenodo  
This report contains details about the modeling automation methodology for fabrication of synthetic and realistic data sets.  ...  It focuses on data and metadata logic extraction from real data and on the way this data is used to create fabrication rules that the platform provides.  ...  The platform can generate data from scratch, inflate existing databases, move existing data, and transform data from previously existing resources, such as old test databases or even production data.  ... 
doi:10.5281/zenodo.4090242 fatcat:5lubtyqmozbk5lr7r4gd4c2myy

Conservative management of cesarean scar pregnancies: a prospective randomized controlled trial at a single center

Mingyi Wang, Zhiling Yang, Yunming Li, Biliang Chen, Jian Wang, Xiangdong Ma, Yu Wang
2015 International Journal of Clinical and Experimental Medicine  
According to the logistic regression model, a gestational sac diameter > 5 cm or type II CSP were independent risk factors for failed CSP management (gestational sac > 5 cm: OR 51.87, 95% CI 3.48-775.91  ...  (MTX) treatment (UAE-MTX), or ultrasound-guided local and systemic MTX treatment (USG-MTX).  ...  Between July 2008 and January 2014, 45 patients with CSP were recruited from the departments of Obstetrics and Gynecology of Xijing Hospital, Fourth Military Medical University, and General Hospital of  ... 
pmid:26770522 pmcid:PMC4694422 fatcat:mv5tsz63ufbwrnqly3h6kxx6zq

Randomized trial of parent training to prevent adolescent problem behaviors during the high school transition

W. Alex Mason, Charles B. Fleming, Thomas J. Gross, Ronald W. Thompson, Gilbert R. Parra, Kevin P. Haggerty, James J. Snyder
2016 Journal of family psychology  
This randomized controlled trial tested a widely used general parent training program, Common Sense Parenting (CSP) ® , with low-income 8th graders and their families to support a positive transition to  ...  The program was tested in its original 6-session format and in a modified format (CSP-Plus), which added 2 sessions that included adolescents.  ...  Guided by considerations outlined in Mason et al. (2014) , attempts were made to test CSP in a way that provided as much verisimilitude with routine practice as possible.  ... 
doi:10.1037/fam0000204 pmid:27504751 pmcid:PMC5138089 fatcat:d2nd4evpnjafbc5ns46y2rof5u

Towards Effective Deep Learning for Constraint Satisfaction Problems [chapter]

Hong Xu, Sven Koenig, T. K. Satish Kumar
2018 Lecture Notes in Computer Science  
We address this issue using the asymptotic behavior of generalized Model A, a new random CSP generation model, along with domain adaptation and data augmentation techniques for CSPs.  ...  Since it is NP-hard to solve CSPs, labeled data required for training are in general costly to produce and are thus scarce.  ...  We generalize Model A [26] to create a random binary CSP generation model, henceforth referred to as generalized Model A. Model A generates a binary CSP as follows [26] .  ... 
doi:10.1007/978-3-319-98334-9_38 fatcat:djqet76n4bf6jdqebtioh5ik4m

NAIS: A Calibrated Immune Inspired Algorithm to Solve Binary Constraint Satisfaction Problems [chapter]

Marcos Zuñiga, María-Cristina Riff, Elizabeth Montero
2007 Lecture Notes in Computer Science  
The tests were carried out using random generated binary constraint satisfaction problems on the transition phase where are the hardest problems.  ...  We propose in this paper an artificial immune system to solve CSPs. The algorithm has been designed following the framework proposed by de Castro and Timmis.  ...  Problems tested on the hard zone The idea of these tests is to study the behavior of the algorithm solving hard problems. We use two models to generate binary CSPs.  ... 
doi:10.1007/978-3-540-73922-7_3 fatcat:lib3pdgiardshh5dt42shk6qcu

A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report)

Eric Horvitz, Yongshao Ruan, Carla Gomes, Henry Kautz, Bart Selman, Max Chickering
2001 Electronic Notes in Discrete Mathematics  
We illustrate the approach with a focus on the task of predicting run time for general and domain-specific solvers on a hard class of structured constraint satisfaction problems.  ...  Finally, we discuss how we can employ the models to inform dynamic run-time decisions.  ...  We created distinct predictive models for each training set and tested these models with cases drawn from test sets containing runs of appropriate minimal length.  ... 
doi:10.1016/s1571-0653(04)00335-x fatcat:z5rjpwgv3vgwdgxv652dxy4ciy


2016 Journal of Mechanics in Medicine and Biology  
With a guiding Communicating Sequential Processes (CSP) model we prove the absence of deadlock and livelock. With the underlying B-machine we prove the absence of invariant violations.  ...  In the specification phase, we have used a formal CSP||B model to define the system functionality.  ...  These operations are executed whenever there is a corresponding event from the guiding CSP model.  ... 
doi:10.1142/s0219519416500652 fatcat:vo2ek5f3bfhxhjw5rwjyklaf6u

Graph Neural Networks for Maximum Constraint Satisfaction

Jan Tönshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe
2021 Frontiers in Artificial Intelligence  
The architecture is generic; it works for all binary constraint satisfaction problems.  ...  Despite being generic, we show that our approach matches or surpasses most greedy and semi-definite programming based algorithms and sometimes even outperforms state-of-the-art heuristics for the specific  ...  Most of the implementation was done by JT, with help and feedback from MR and HW. The work was supervised by MG.  ... 
doi:10.3389/frai.2020.580607 pmid:33733220 pmcid:PMC7959828 fatcat:y5jf5virxvhx5lqcrfbrfuinna

Adaptation using constraint satisfaction techniques [chapter]

Lisa Purvis, Pearl Pu
1995 Lecture Notes in Computer Science  
We have tested our methodology in the configuration design and assembly sequence generation domains. Analysis of performance and results will be shown at the end of this paper.  ...  The difficulties arise from the fact that adaptation often does not converge, especially if it is not done in a systematic way.  ...  Thus, from Case 1, all constraints having to do with MODEL-80 (C1, C2, C3, C4), and all variables encountered in those constraints (MODEL, FUEL-EFF, BODY, ENGINE, BATTERY) are added to the new CSP.  ... 
doi:10.1007/3-540-60598-3_26 fatcat:dupkpmfmp5bizhjwezm6gshagq

Does voluntary corporate social performance attract institutional investment? Evidence from China

Mingzhu Wang, Yugang Chen
2017 Corporate governance: An International Review  
ACKNOWLEDGEMENTS We appreciate the insightful comments from the two anonymous reviewers, which made a substantial contribution towards the development of the paper.  ...  Yugang Chen would like to thank the financial support from National Natural Science Foundation of China (approval numbers 71372147) and the Fundamental Research Funds for the Central Universities.  ...  Table 6 reports regression results for model (4), testing this likelihood.  ... 
doi:10.1111/corg.12205 fatcat:s2tvntbzyrcltm6por2ydclece

The UniForM workbench a universal development environment for formal methods [chapter]

Bernd Krieg-Brückner, Jan Peleska, Ernst-Rüdiger Olderog, Alexander Baer
1999 Lecture Notes in Computer Science  
Workbench supports combination of Formal Methods (on a solid logical foundation), provides tools for the development of hybrid, real-time or reactive systems, transformation, verification, validation and testing  ...  Test cases are generated from a real-time specification; they drive the completed hardware/software system as a "black box" in a hardware-in-the-loop configuration from a separate computer containing the  ...  its enactment guiding and controlling the use of methods and tools, and (4) provide automatically generated development documents.  ... 
doi:10.1007/3-540-48118-4_13 fatcat:fwwpfuyds5euzmnl4mts46imqm

A Bayesian Approach to Tackling Hard Computational Problems [article]

Eric J. Horvitz, Yongshao Ruan, Carla P. Gomes, Henry Kautz, Bart Selman, David Maxwell Chickering
2013 arXiv   pre-print
We are developing a general framework for using learned Bayesian models for decision-theoretic control of search and reasoningalgorithms.  ...  We show how to create a dynamic cut off strategy by learning a Bayesian model that predicts the ultimate length of a trial based on observing the early behavior of the search algorithm.  ...  and testing ten separate models.  ... 
arXiv:1301.2279v1 fatcat:34fcn47gozgrtddvrhu4nnzxmi
« Previous Showing results 1 — 15 out of 10,359 results