Sciweavers

99 search results - page 19 / 20
» Improved bounds and new techniques for Davenport-Schinzel se...
Sort
View
AAAI
2000
13 years 6 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
13 years 10 months ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...
BMCBI
2008
108views more  BMCBI 2008»
13 years 5 months ago
A nonparametric model for quality control of database search results in shotgun proteomics
Background: Analysis of complex samples with tandem mass spectrometry (MS/MS) has become routine in proteomic research. However, validation of database search results creates a bo...
Jiyang Zhang, Jianqi Li, Xin Liu, Hongwei Xie, Yun...
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
13 years 10 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
EUROCRYPT
2009
Springer
14 years 5 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir