• No results found

Constraint Satisfaction Problem (CSP)

Sharp Thresholds for a Random Constraint Satisfaction Problem

Sharp Thresholds for a Random Constraint Satisfaction Problem

... The constraint satisfaction problem (CSP in short), originated from the artificial intelligence, has become an important topic in the interdisciplinary research of computer science, ...

11

Service robot planning via solving constraint satisfaction problem

Service robot planning via solving constraint satisfaction problem

... The problem of demographic shifts towards the elderly is deteriorating, as the relative number of caregivers is insuf- ficient to provide the support required for their wellbeing, which is further aggravated by ...

17

An effective dichotomy for the counting constraint satisfaction problem

An effective dichotomy for the counting constraint satisfaction problem

... The constraint satisfaction problem (CSP) is ubiquitous in computer ...[17]. CSP is directly equivalent to the problem of evaluating conjunctive queries on databases [22] and to ...

30

CONSTRAINT SATISFACTION PROBLEM: A CASE STUDY Jyoti 1, Tarun Dalal2

CONSTRAINT SATISFACTION PROBLEM: A CASE STUDY Jyoti 1, Tarun Dalal2

... the constraint-satisfaction ...A constraint satisfaction problem (CSP) requires a value, selected from a given finite domain, to be assigned to each variable in the ...

6

Effects of Dynamic Variable - Value Ordering  Heuristics on the Search Space of Sudoku Modeled as a Constraint Satisfaction Problem

Effects of Dynamic Variable - Value Ordering Heuristics on the Search Space of Sudoku Modeled as a Constraint Satisfaction Problem

... a CSP. Sudoku was first studied as a CSP in [7] and has been been getting a lot of attention in this field since then [8, 9, 10, 11, 12, 13], because it is a highly constrained challenging combinatorial ...

15

Invariants and Other Structural Properties of Biochemical Models as a Constraint Satisfaction Problem

Invariants and Other Structural Properties of Biochemical Models as a Constraint Satisfaction Problem

... a constraint-based approach fares reasonably well, usually in the same order of magni- tude as some purely symbolic encoding via decision diagrams [17], whereas the solutions of the CSP are ...

9

Reduction and Analysis of a Max Plus Linear System to a Constraint Satisfaction Problem for Mixed Integer Programming

Reduction and Analysis of a Max Plus Linear System to a Constraint Satisfaction Problem for Mixed Integer Programming

... This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an ap- proach to model and analyze a class of discrete-event systems, in ...

8

Algorithmic Approaches to Playing Minesweeper

Algorithmic Approaches to Playing Minesweeper

... a Constraint Satisfaction Problem”, Chris Studholme suggests improvements to the random move selection process that are independent of the CSP model ...

41

Metamorphic testing of constraint solvers

Metamorphic testing of constraint solvers

... a constraint satisfaction problem (CSP), given any unsolvable CSP, adding a constraint or removing domain values from a variable should result in another unsolvable ...

10

A DIFFERENTIAL EVOLUTION ALGORITHM PARALLEL IMPLEMENTATION IN A GPU

A DIFFERENTIAL EVOLUTION ALGORITHM PARALLEL IMPLEMENTATION IN A GPU

... A Constraint Satisfaction Problem (CSP) is a formalism to represent combinatorial ...a CSP we need to find objects that satisfy a number of constraints ...

5

Towards a Characterization of Approximation Resistance for Symmetric CSPs

Towards a Characterization of Approximation Resistance for Symmetric CSPs

... Boolean constraint satisfaction problem (CSP) is called approximation re- sistant if independently setting variables to 1 with some probability α achieves the best possible approximation ratio ...

24

Maximum constraint satisfaction on diamonds

Maximum constraint satisfaction on diamonds

... imum constraint satisfaction problem ( Max CSP ) over an arbitrary fi- nite ...this problem, one is given a collection of weighted con- straints on overlapping sets of variables, and ...

19

Systematic vs  Non Systematic Search for 3D Aircraft Conflict Resolution

Systematic vs Non Systematic Search for 3D Aircraft Conflict Resolution

... the problem of solving conflicts arising among several aircraft moving in a shared airspace as a Constraint Satisfac- tion Problem ...The constraint satisfaction problem being ...

7

Genetic based discrete particle swarm optimization for elderly day care center timetabling

Genetic based discrete particle swarm optimization for elderly day care center timetabling

... timetabling problem of local Elderly Day Care Centers (EDCCs) is formulated into a weighted maximum constraint satisfaction problem (Max-CSP) in this ...timetabling problem is a ...

34

Distributed Constraint Satisfaction Problems – Systematic Review

Distributed Constraint Satisfaction Problems – Systematic Review

... A Constraint satisfaction problem (CSP) is to find a consistent assignment of values to variables under the given ...n-queen problem is a constraint satisfaction ...

8

Eliminative Parsing with Graded Constraints

Eliminative Parsing with Graded Constraints

... Parsing, then, is modelled as a partial constraint satisfaction problem with scores Tsang, 1993 which can almost always be disambiguated towards a single solution if only the grammar pro[r] ...

5

Super resolution target identification from remotely sensed images using a Hopfield neural network

Super resolution target identification from remotely sensed images using a Hopfield neural network

... Abstract—Fuzzy classification techniques have been developed recently to estimate the class composition of image pixels, but their output provides no indication of how these classes are distributed spatially within the ...

16

An Architecture Independent Packing Method for LUT-based Commercial FPGA

An Architecture Independent Packing Method for LUT-based Commercial FPGA

... the constraint satisfaction problem technique of graph matching is utilised to implement specific logic such as 7-LUT, 8-LUT and carry chain arithmetic logic from the given user design ...

7

Abstract: It is a well-known fact that every plant has an occurrence matrix and every matrix has a well known

Abstract: It is a well-known fact that every plant has an occurrence matrix and every matrix has a well known

... Interval Constraint Satisfaction Problem which solved by Interval Constraint Satisfaction Technique involving singular value decomposition and dimension reduction by principal component ...

5

Performance analysis and optimization for workflow authorization

Performance analysis and optimization for workflow authorization

... The work conducted theoretical analysis and found out that in order to check whether there is a valid the workflow au- thorization, it only needs to consider a single linear extension (i.e., a linear ordering) of the ...

14

Show all 10000 documents...

Related subjects