2218 search results - page 165 / 444 » Testing Expressibility Is Hard |
IJCAI
2003
13 years 10 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
AAAI
1997
13 years 10 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
CIIA
2009
13 years 10 months ago
2009
The project aimed at developing a software audiometer for hearing loss screening. The proposed software is definitely based on the internal peripherals of the computer without any ...
DAM
2008
13 years 9 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
AMC
2006
13 years 9 months ago
2006
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...