Sciweavers

2482 search results - page 51 / 497
» Analysis and Presentation of Results for Mobile Local Search
Sort
View
AIPS
2006
14 years 11 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
APWEB
2005
Springer
15 years 3 months ago
Using Probabilistic Latent Semantic Analysis for Personalized Web Search
Web users use search engine to find useful information on the Internet. However current web search engines return answer to a query independent of specific user information need. S...
Chenxi Lin, Gui-Rong Xue, Hua-Jun Zeng, Yong Yu
DIALM
2007
ACM
131views Algorithms» more  DIALM 2007»
15 years 1 months ago
Dessy: Towards Flexible Mobile Desktop Search
In the near future, mobile devices are expected to have a storage capacity comparable to today's desktop machines. As the amount of infomation grows, conventional search tool...
Eemil Lagerspetz, Tancred Lindholm, Sasu Tarkoma
AI
2005
Springer
15 years 3 months ago
SWAMI: Searching the Web Using Agents with Mobility and Intelligence
The rapid growth of the World Wide Web has complicated the process of web browsing by providing an overwhelming wealth of choices for the end user. To alleviate this burden, intell...
Mark Kilfoil, Ali A. Ghorbani
ATAL
2009
Springer
15 years 4 months ago
Sensitivity analysis for distributed optimization with resource constraints
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
Emma Bowring, Zhengyu Yin, Rob Zinkov, Milind Tamb...