3919 search results - page 537 / 784 » Modelling Dynamic Forgetting in Distributed Information Syst... |
194
click to vote
ISOLA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Interoperability remains a fundamental challenge when connecting heterogeneous systems which encounter and spontaneously communicate with one another in pervasive computi...
219
click to vote
SIGSOFT
1994
ACM
15 years 10 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
165
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ï...
193
Voted
ICSE
2001
IEEE-ACM
15 years 11 months ago
2001
IEEE-ACM
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
178
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
In wireless ad hoc networks, capacity can be traded for delay. This tradeoff has been the subject of a number of studies, mainly concentrating on the two extremes: either minimizi...