606 search results - page 60 / 122 » Complexity Results for Checking Distributed Implementability |
91
Voted
HOTI
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we propose an Ethernet-based transmission-guaranteed, congestion-controlled network using a simplified multi-path aggregation scheme. Multi-path aggregation increas...
123
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
100
Voted
CLUSTER
2007
IEEE
15 years 5 months ago
2007
IEEE
Bulk memory copies incur large overheads such as CPU stalling (i.e., no overlap of computation with memory copy operation), small register-size data movement, cache pollution, etc...
159
click to vote
CI
2000
15 years 1 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
152
click to vote
MIR
2005
ACM
15 years 7 months ago
2005
ACM
A typical way to perform video annotation requires to classify video elements (e.g. events and objects) according to some pre-defined ontology of the video content domain. Ontolo...