Sciweavers

1356 search results - page 63 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
ATAL
2006
Springer
14 years 29 days ago
Teaching new teammates
Knowledge transfer between expert and novice agents is a challenging problem given that the knowledge representation and learning algorithms used by the novice learner can be fund...
Doran Chakraborty, Sandip Sen
BMCBI
2006
108views more  BMCBI 2006»
13 years 9 months ago
A new pooling strategy for high-throughput screening: the Shifted Transversal Design
Background: In binary high-throughput screening projects where the goal is the identification of low-frequency events, beyond the obvious issue of efficiency, false positives and ...
Nicolas Thierry-Mieg
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
14 years 1 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 10 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
SIAMJO
2002
77views more  SIAMJO 2002»
13 years 9 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright