7943 search results - page 99 / 1589 » A calculus for costed computations |
77
Voted
DLOG
2006
14 years 11 months ago
2006
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...
CVPR
2008
IEEE
16 years 10 days ago
2008
IEEE
In the last decades several cost aggregation methods aimed at improving the robustness of stereo correspondence within local and global algorithms have been proposed. Given the re...
GI
2001
Springer
15 years 2 months ago
2001
Springer
Abstract: This paper presents the information aggregation methods enabling cost- and QoS-aware service deployment. It is expected that network management tools will require the net...
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
MMB
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...