780 search results - page 90 / 156 » Reasoning about sets using redescription mining |
110
click to vote
SRDS
2006
IEEE
15 years 6 months ago
2006
IEEE
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
107
click to vote
CORR
2002
Springer
15 years 15 days ago
2002
Springer
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
94
Voted
SAS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
110
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive. This paper proposes an automatic semantic relat...
114
click to vote
KR
1998
Springer
15 years 4 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...