5606 search results - page 805 / 1122 » Randomization Techniques for Graphs. |
228
click to vote
ICDCIT
2005
Springer
16 years 25 days ago
2005
Springer
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
212
click to vote
SEMWEB
2005
Springer
16 years 24 days ago
2005
Springer
In many practical applications, ontologies tend to be very large and complicated. In order for users to quickly understand and analyze large-scale ontologies, in this paper we prop...
197
click to vote
AUSAI
2005
Springer
16 years 23 days ago
2005
Springer
The key problem in applying verification techniques such as model checking to agent architectures is to show how to map systematically from an agent program to a model structure t...
189
click to vote
DMSN
2004
ACM
16 years 22 days ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
189
click to vote
SC
2004
ACM
16 years 22 days ago
2004
ACM
This work describes a technique for improving network performance in Grid environments that we refer to as “logistics.” We demonstrate that by using storage and cooperative fo...