Sciweavers

1225 search results - page 81 / 245
» The Instance Complexity Conjecture
Sort
View
NECO
2002
117views more  NECO 2002»
13 years 8 months ago
Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
James M. Coughlan, Alan L. Yuille
LATIN
2010
Springer
13 years 7 months ago
The Interval Constrained 3-Coloring Problem
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanit&a...
ISSTA
2006
ACM
14 years 3 months ago
Coverage and adequacy in software product line testing
Software product line modeling has received a great deal of attention for its potential in fostering reuse of software artifacts across development phases. Research on the testing...
Myra B. Cohen, Matthew B. Dwyer, Jiangfan Shi
COCOON
2009
Springer
14 years 3 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
IJCAI
2007
13 years 10 months ago
Transfer Learning in Real-Time Strategy Games Using Hybrid CBR/RL
The goal of transfer learning is to use the knowledge acquired in a set of source tasks to improve performance in a related but previously unseen target task. In this paper, we pr...
Manu Sharma, Michael P. Holmes, Juan Carlos Santam...