920 search results - page 143 / 184 » Generating Satisfiable Problem Instances |
COMBINATORICS
1999
13 years 7 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
AAIM
2009
Springer
13 years 5 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
ICMLA
2009
13 years 5 months ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
AAAI
2006
13 years 9 months ago
2006
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...