Sciweavers

6455 search results - page 432 / 1291
» Research problems
Sort
View
ICNP
2005
IEEE
16 years 13 days ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
IPPS
1999
IEEE
15 years 11 months ago
Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...
Warren Smith, Valerie E. Taylor, Ian T. Foster
FCT
1991
Springer
15 years 10 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
AIPS
2007
15 years 9 months ago
Monitoring Plan Optimality During Execution
A great deal of research has addressed the problem of generating optimal plans, but these plans are of limited use in circumstances where noisy sensors, unanticipated exogenous ac...
Christian Fritz, Sheila A. McIlraith
COLING
2008
15 years 8 months ago
Mining Opinions in Comparative Sentences
This paper studies sentiment analysis from the user-generated content on the Web. In particular, it focuses on mining opinions from comparative sentences, i.e., to determine which...
Murthy Ganapathibhotla, Bing Liu