Sciweavers

1650 search results - page 269 / 330
» The HOM problem is decidable
Sort
View
CORR
2008
Springer
66views Education» more  CORR 2008»
13 years 10 months ago
A Novel Approach to Formulae Production and Overconfidence Measurement to Reduce Risk in Spreadsheet Modelling
Research on formulae production in spreadsheets has established the practice as high risk yet unrecognised as such by industry. There are numerous software applications that are d...
Simon R. Thorne, David Ball, Zoe Lawson
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 10 months ago
A Model-Based Frequency Constraint for Mining Associations from Transaction Data
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
Michael Hahsler
FUIN
2008
98views more  FUIN 2008»
13 years 10 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
IANDC
2008
122views more  IANDC 2008»
13 years 10 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
IJAMC
2008
85views more  IJAMC 2008»
13 years 10 months ago
Scalable reputation management with trustworthy user selection for P2P MMOGs
: Recent research on Peer-to-Peer Massively Multiplayer Online Games (P2P MMOGs) has tried to find more scalable and affordable solutions to build virtual environments via the reso...
Guan-Yu Huang, Shun-Yun Hu, Jehn-Ruey Jiang