Sciweavers

5316 search results - page 327 / 1064
» Which Search Problems Are Random
Sort
View
OPODIS
2004
15 years 8 months ago
Searching for a Black Hole in Tree Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
ICDE
2011
IEEE
215views Database» more  ICDE 2011»
14 years 10 months ago
Top-k keyword search over probabilistic XML data
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
TC
2008
15 years 7 months ago
On the Computational Security of a Distributed Key Distribution Scheme
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
Vanesa Daza, Javier Herranz, Germán S&aacut...
SIGIR
2009
ACM
16 years 1 months ago
Click-through prediction for news queries
A growing trend in commercial search engines is the display of specialized content such as news, products, etc. interleaved with web search results. Ideally, this content should b...
Arnd Christian König, Michael Gamon, Qiang Wu
IPPS
2000
IEEE
15 years 11 months ago
A Parallel Co-evolutionary Metaheuristic
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
Vincent Bachelet, El-Ghazali Talbi