Sciweavers

130 search results - page 12 / 26
» A CSP Search Algorithm with Responsibility Sets and Kernels
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
Request-Aware Scheduling for Busy Internet Services
— Internet traffic is bursty and network servers are often overloaded with surprising events or abnormal client request patterns. This paper studies scheduling algorithms for in...
Jingyu Zhou, Caijie Zhang, Tao Yang, Lingkun Chu
CP
2003
Springer
15 years 3 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
15 years 11 months ago
DSphere: A Source-Centric Approach to Crawling, Indexing and Searching the World Wide Web
We describe DSPHERE1 - a decentralized system for crawling, indexing, searching and ranking of documents in the World Wide Web. Unlike most of the existing search technologies tha...
Bhuvan Bamba, Ling Liu, James Caverlee, Vaibhav Pa...
SPIRE
2004
Springer
15 years 3 months ago
Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Fraylin...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera