Sciweavers

1971 search results - page 230 / 395
» Tabu search - Uncharted domains
Sort
View
CPAIOR
2010
Springer
15 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
SDMW
2010
Springer
15 years 4 months ago
Computationally Efficient Searchable Symmetric Encryption
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little ...
Peter van Liesdonk, Saeed Sedghi, Jeroen Doumen, P...
ATAL
2009
Springer
15 years 4 months ago
Learning to Locate Trading Partners in Agent Networks
This paper is motivated by some recent, intriguing research results involving agent-organized networks (AONs). In AONs, nodes represent agents, and collaboration between nodes are...
John Porter, Kuheli Chakraborty, Sandip Sen
DEXA
2009
Springer
176views Database» more  DEXA 2009»
15 years 4 months ago
Analyzing Document Retrievability in Patent Retrieval Settings
Most information retrieval settings, such as web search, are typically precision-oriented, i.e. they focus on retrieving a small number of highly relevant documents. However, in sp...
Shariq Bashir, Andreas Rauber
IDEAL
2009
Springer
15 years 4 months ago
Optimizing Data Transformations for Classification Tasks
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
José María Valls, Ricardo Aler