11 search results - page 2 / 3 » GENET: A Connectionist Architecture for Solving Constraint S... |
SGAI
2007
Springer
13 years 11 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
AI
2000
Springer
13 years 4 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
ATS
2001
IEEE
13 years 8 months ago
2001
IEEE
Test access is a major problem for core-based systemon-chip (SOC) designs. Since cores in an SOC are not directly accessible via chip inputs and outputs, special access mechanisms...
CONSTRAINTS
2008
13 years 5 months ago
2008
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
AI
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...