NDLI: Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies

Please wait, while we are loading the content...

Efficiently Reasoning about Qualitative Constraints through Variable Elimination

A planning problem validator based on reachability analysis

Modeling and Enactment of Business Agents Using Jason

Short-Term Load Forecasting using a Cluster of Neural Networks for the Greek Energy Market

Hybrid Evolutionary Algorithms in Resource Leveling Optimization: Application in a Large Real Construction Project of a 50000 DWT Ship

Real-time Bite Detection from Smartwatch Orientation Sensor Data

Artificial Intelligence meets Software Engineering in Computing Education

Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies

Grid Search for Operator and Parameter Control in Differential Evolution

Autonomous navigation of an over-actuated marine platform using reinforcement learning

Improving Text Stream Clustering using Term Burstiness and Co-burstiness

Evolving Multi-Layer Neural Networks for Othello

A Real-Time Approach for Gesture Recognition using the Kinect Sensor

A Semantic Annotation Model for Arabic Legal Texts

A constrained molecular graph generation with imposed and forbidden fragments

Piece of Pie Search: Confidently Exploiting Heuristics

Energy Management in Solar Microgrid via Reinforcement Learning

Content Representation and Similarity of Movies based on Topic Extraction from Subtitles

Relevance Feedback in Deep Convolutional Neural Networks for Content Based Image Retrieval

Complex layout analysis based on contour classification and morphological operations

A Semantic Approach to Film Content Analysis and Retrieval

Constraint Programming MapReduce'd

A Neo4j Implementation of Fuzzy Random Walkers

EVLib: A Library for the Management of the Electric Vehicles in the Smart Grid

Detecting hyperplane clusters with adaptive possibilistic clustering

Efficient MapReduce Kernel k-Means for Big Data Clustering

Distance Measurement of Objects using Stereo Vision

ReSkill: Relative Skill-Level Calculation System

Simultaneous Localisation and Mapping to Reach Linguistically-Defined Targets

Spectral Clustering using Optimized Bag-of-Features

Determination of a new formula for the electrical fast transient / burst waveform using genetic algorithm

Greek sign language alphabet recognition using the leap motion device

Classifier-assisted optimization

Automatic Forest Wood Logging Identification based on Acoustic Monitoring

A Bag of Words approach for recognition of Greek folk dances

Ensemble Feature Selection using Rank Aggregation Methods for Population Genomic Data

Segmento: An R-based Visualization-rich System for Customer Segmentation and Targeting

Clustering Software Metric Values Extracted from C# Code for Maintainability Assessment

Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies

Content Provider	ACM Digital Library
Author	Stergiou, Kostas Dasygenis, Minas
Abstract	Local consistencies stronger than arc consistency have received a lot of attention since the early days of CSP research because of the strong pruning they can achieve. However, they have not been widely adopted by CSP solvers. This is because applying such consistencies can sometimes result in considerably smaller search tree sizes and therefore in important speed-ups, but in other cases the search space reduction may be small, causing severe run time penalties. Taking advantage of recent advances in parallelization, we propose a novel approach for the application of strong local consistencies that can improve their performance by largely preserving the speed-ups they offer in cases where they are successful, and eliminating the run time penalties in cases where they are unsuccessful. This approach is presented in the form of a search algorithm consisting of a master search process, which is a typical CSP solver, and a number of slave processes, which can implement strong local consistency algorithms. The only requirement for the implementation and usage of the proposed algorithm is the availability of a multi-core machine. Preliminary experimental results demonstrate the benefits of the proposed method.
Starting Page	1
Ending Page	7
Page Count	7
File Format	PDF
ISBN	9781450337342
DOI	10.1145/2903220.2903228
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-05-18
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Exploiting the Pruning Power of Strong Local Consistencies Through Parallelization

Integrating strong local consistencies into constraint solvers (2011)

Integrating strong local consistencies into constraint solvers (2010).

Integrating strong local consistencies into constraint solvers (2011)

A practical approach of memory access parallelization to exploit multiple off-chip DDR memories

Lookahead in Smodels compared to local consistencies in CSP (2005)

A generic scheme for integrating strong local consistencies into constraint solvers.

A Generic Scheme for Integrating Strong Local Consistencies into Constraint Solvers

Strong local consistency algorithms for table constraints

Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies

Similar Documents

Exploiting the Pruning Power of Strong Local Consistencies Through Parallelization

Integrating strong local consistencies into constraint solvers (2011)

Integrating strong local consistencies into constraint solvers (2010).

Integrating strong local consistencies into constraint solvers (2011)

A practical approach of memory access parallelization to exploit multiple off-chip DDR memories

Lookahead in Smodels compared to local consistencies in CSP (2005)

A generic scheme for integrating strong local consistencies into constraint solvers.

A Generic Scheme for Integrating Strong Local Consistencies into Constraint Solvers

Strong local consistency algorithms for table constraints

Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies