1951 search results - page 187 / 391 » An algorithm for improving graph partitions |
170
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
143
click to vote
FORMATS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
173
Voted
AINA
2007
IEEE
16 years 11 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
253
click to vote
ICPP
2006
IEEE
16 years 2 days ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
154
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combin...