Sciweavers

914 search results - page 154 / 183
» Branch and Bound on the Network Model
Sort
View
MIDDLEWARE
2005
Springer
14 years 3 months ago
Frugal Event Dissemination in a Mobile Environment
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
Sébastien Baehni, Chirdeep Singh Chhabra, R...
VRST
2003
ACM
14 years 3 months ago
Partitioning crowded virtual environments
We investigate several techniques that partition a crowded virtual environment into regions that can be managed by separate servers or mapped onto different multicast groups. When...
Anthony Steed, Roula Abou-Haidar
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
14 years 2 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
IJCAI
1997
13 years 11 months ago
A Symmetric View of Utilities and Probabilities
Motivated by the need to reason about utilities, and inspired by the success of bayesian networks in representing and reasoning about probabilities, we introduce the notion of uti...
Yoav Shoham
MP
2008
99views more  MP 2008»
13 years 9 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey