150 search results - page 2 / 30 » Solving Small TSPs with Constraints |
IJIT
2004
13 years 6 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
CDC
2009
IEEE
13 years 2 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
PTS
2010
13 years 2 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
AAAI
2006
13 years 6 months ago
2006
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
AAAI
1990
13 years 6 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...