Sciweavers

3055 search results - page 14 / 611
» Randomized Search Trees
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
FLAIRS
2004
13 years 9 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
JAIR
2007
106views more  JAIR 2007»
13 years 7 months ago
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
J. Christopher Beck
SDMW
2004
Springer
14 years 1 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker
DAM
2010
101views more  DAM 2010»
13 years 7 months ago
On the distribution of distances between specified nodes in increasing trees
We study the quantity distance between node j and node n in a random tree of size n for increasing tree families. We give closed formul
Markus Kuba, Alois Panholzer