Sciweavers

3528 search results - page 252 / 706
» A New Approach to Planning in Networks
Sort
View
INFOCOM
2003
IEEE
15 years 12 months ago
Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman, L...
142
Voted
ACL
1997
15 years 8 months ago
Choosing the Word Most Typical in Context Using a Lexical Co-Occurrence Network
This paper presents a partial solution to a component of the problem of lexical choice: choosing the synonym most typical, or expected, in context. We apply a new statistical appr...
Philip Edmonds
IUI
2006
ACM
16 years 19 days ago
Who's asking for help?: a Bayesian approach to intelligent assistance
Automated software customization is drawing increasing attention as a means to help users deal with the scope, complexity, potential intrusiveness, and ever-changing nature of mod...
Bowen Hui, Craig Boutilier
HICSS
2003
IEEE
164views Biometrics» more  HICSS 2003»
15 years 12 months ago
From Computer Networks to Agent Networks
From the 1990s on, one of the most important challenges facing computer science researchers has been the design and construction of software tools to exploit Internet computing. A...
Guoqiang Zhong, Kenichi Takahashi, Satoshi Amamiya...
PERCOM
2008
ACM
16 years 6 months ago
A Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks
Service placement deals with the problem of selecting which node in a network is most suitable for hosting a service that responds to queries from other nodes. Optimally placing s...
Georg Wittenburg, Jochen H. Schiller