Sciweavers

510 search results - page 38 / 102
» How Should We Solve Search Problems Privately
Sort
View
FUIN
2010
93views more  FUIN 2010»
13 years 6 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien
LSO
2001
Springer
13 years 12 months ago
Skills Management as Knowledge Technology in a Software Consultancy Company
This paper presents a skills management system in a medium-sized software consulting company, and how it is used. We found four different types of usage: Searching for competence t...
Torgeir Dingsøyr, Emil Røyrvik
AMEC
2004
Springer
14 years 29 days ago
Designing Auctions for Deliberative Agents
Abstract. In many settings, bidding agents for auctions do not know their preferences a priori. Instead, they must actively determine them through deliberation (e.g., information p...
Kate Larson, Tuomas Sandholm
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 11 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
CEC
2007
IEEE
13 years 11 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty