Sciweavers

721 search results - page 127 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
96
Voted
AAAI
2004
15 years 1 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
IJCAI
2001
15 years 1 months ago
Making AC-3 an Optimal Algorithm
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
Yuanlin Zhang, Roland H. C. Yap
116
Voted
CORR
1998
Springer
126views Education» more  CORR 1998»
14 years 11 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
94
Voted
IJIIDS
2010
115views more  IJIIDS 2010»
14 years 10 months ago
Towards the preservation of functional dependency in XML data transformation
With the advent of XML as a data representation and exchange format over the web, a massive amount of data is being stored in XML. The task of data transformation for integration ...
Md. Sumon Shahriar, Jixue Liu
79
Voted
TALG
2010
110views more  TALG 2010»
14 years 10 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx