400 search results - page 57 / 80 » What Makes a Problem GP-Hard |
155
click to vote
CSUR
1999
15 years 3 months ago
1999
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
159
Voted
IANDC
2011
14 years 11 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
166
click to vote
ACMICEC
2006
ACM
15 years 10 months ago
2006
ACM
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
128
click to vote
JFP
2006
15 years 4 months ago
2006
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
126
click to vote
PVLDB
2010
15 years 2 months ago
2010
Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to “clean”, or remove, ...