Sciweavers

681 search results - page 23 / 137
» Searching with expectations
Sort
View
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
15 years 4 months ago
Tree patterns with Full Text Search
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
Maria-Hendrike Peetz, Maarten Marx
76
Voted
IPM
2008
100views more  IPM 2008»
14 years 11 months ago
Contextual factors affecting the utility of surrogates within exploratory search
In this paper we investigate how information surrogates might be useful in exploratory search and what information it is useful for a surrogate to contain. By comparing assessment...
Ian Ruthven, Mark Baillie, Leif Azzopardi, Ralf Bi...
CEC
2009
IEEE
15 years 6 months ago
Dynamic search initialisation strategies for multi-objective optimisation in peer-to-peer networks
Abstract— Peer-to-peer based distributed computing environments can be expected to be dynamic to greater of lesser degree. While node losses will not usually lead to catastrophic...
Ian Scriven, Andrew Lewis, Sanaz Mostaghim
93
Voted
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 24 days ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
ADHOC
2007
101views more  ADHOC 2007»
14 years 12 months ago
Searching strategies for target discovery in wireless networks
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
Zhao Cheng, Wendi B. Heinzelman