27 search results - page 2 / 6 » Efficient feasibility testing for dial-a-ride problems |
TEC
2010
13 years 2 months ago
2010
A new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
JCST
2008
13 years 7 months ago
2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper, we propose a new robust approach to signal backtrace for efficiently testing embedded analog modules in a large system. The proposed signal backtrace method is form...