Sciweavers

99 search results - page 18 / 20
» RNC Algorithms for the Uniform Generation of Combinatorial S...
Sort
View
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
TCIAIG
2010
13 years 2 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
DGO
2007
150views Education» more  DGO 2007»
13 years 9 months ago
Event-triggered data and knowledge sharing among collaborating government organizations
Solving complex global problems such as illegal immigration, border control, and terrorism requires government organizations at all levels to share not only data but, more importa...
Seema Degwekar, Jeff DePree, Howard W. Beck, Carla...
BMCBI
2006
100views more  BMCBI 2006»
13 years 7 months ago
STAR: predicting recombination sites from amino acid sequence
Background: Designing novel proteins with site-directed recombination has enormous prospects. By locating effective recombination sites for swapping sequence parts, the probabilit...
Denis C. Bauer, Mikael Bodén, Ricarda Thier...