510 search results - page 33 / 102 » How Should We Solve Search Problems Privately |
CP
2005
Springer
14 years 1 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
SC
1995
ACM
13 years 11 months ago
1995
ACM
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
AIIA
2003
Springer
13 years 11 months ago
2003
Springer
This paper attempts to analyze the issue of planning and scheduling integration from the point of view of information sharing. This concept is the basic bridging factor between the...
EMNLP
2009
13 years 5 months ago
2009
Three methods are proposed to classify queries by intent (CQI), e.g., navigational, informational, commercial, etc. Following mixed-initiative dialog systems, search engines shoul...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...