10707 search results - page 1905 / 2142 » Designing executable abstractions |
190
Voted
ANTSW
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We study through simulation the performance of two MANET routing algorithms in a realistic urban environment. The two algorithms, AODV and AntHocNet, are representative o...
245
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
196
click to vote
ARGMAS
2008
Springer
15 years 9 months ago
2008
Springer
Many practitioners view agent interaction protocols as rigid specifications that are defined a priori, and hard-code their agents with a set of protocols known at design time -- a...
188
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
on models are abstract representations of systems one wants to study through computer simulation. In multiagent based simulation, such models usually represent agents and their re...
171
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
BDI agent languages provide a useful abstraction for complex systems comprised of interactive autonomous entities, but they have been used mostly in the context of single agents w...