1241 search results - page 153 / 249 » Path-oriented random testing |
FLAIRS
2003
15 years 3 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
134
click to vote
IJCAI
2003
15 years 3 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...
TREC
2004
15 years 3 months ago
2004
Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text sp...
100
click to vote
WSC
1998
15 years 3 months ago
1998
Causality constraints of random discrete simulation make parallel and distributed processing difficult. Methods of applying reconfigurable logic to implement and accelerate simula...
158
click to vote
AAAI
1996
15 years 3 months ago
1996
Procedural representations of control policies have two advantages when facing the scale-up problem in learning tasks. First they are implicit, with potential for inductive genera...