Sciweavers

1941 search results - page 139 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
WWW
2011
ACM
14 years 5 months ago
The design and usage of tentative events for time-based social coordination in the enterprise
Existing enterprise calendaring systems have suffered from problems like rigidity, lack of transparency, and poor integration with social networks. We present the system design an...
Mikhil Masli, Werner Geyer, Casey Dugan, Beth Brow...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
15 years 4 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
MOBIHOC
2006
ACM
15 years 9 months ago
Fundamental scaling laws for energy-efficient storage and querying in wireless sensor networks
We use a constrained optimization framework to derive fundamental scaling laws for both unstructured sensor networks (which use blind sequential search for querying) and structure...
Joon Ahn, Bhaskar Krishnamachari
SIGOPSE
2004
ACM
15 years 3 months ago
Defending against eclipse attacks on overlay networks
Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains pointers to a set of neighbor no...
Atul Singh, Miguel Castro, Peter Druschel, Antony ...
IWCMC
2006
ACM
15 years 4 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan