Sciweavers

331 search results - page 2 / 67
» Comparing Reductions to NP-Complete Sets
Sort
View
LPNMR
2009
Springer
13 years 10 months ago
On Reductive Semantics of Aggregates in Answer Set Programming
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
Joohyung Lee, Yunsong Meng
ICDAR
2011
IEEE
12 years 5 months ago
Comparative Study of Part-Based Handwritten Character Recognition Methods
—The purpose of this paper is to introduce three part-based methods for handwritten character recognition and then compare their performances experimentally. All of those methods...
Wang Song, Seiichi Uchida, Marcus Liwicki
AAAI
2008
13 years 8 months ago
A Reductive Semantics for Counting and Choice in Answer Set Programming
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions...
Joohyung Lee, Vladimir Lifschitz, Ravi Palla
SOCO
2008
Springer
13 years 5 months ago
Tabu search for attribute reduction in rough set theory
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...
Abdel-Rahman Hedar, Jue Wang, Masao Fukushima
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
13 years 11 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson