64 search results - page 9 / 13 » Extending GENET to Solve Fuzzy Constraint Satisfaction Probl... |
ECP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
WIOPT
2011
IEEE
12 years 11 months ago
2011
IEEE
—In this paper, we address the spectrum portfolio optimization (SPO) question in the context of secondary spectrum markets, where bandwidth (spectrum access rights) can be bought...
CSCLP
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
FLAIRS
2008
13 years 10 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
SODA
2010
ACM
13 years 6 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...