Sciweavers

307 search results - page 13 / 62
» A Comparison of Algorithms for Connected Set Openings and Cl...
Sort
View
HT
2009
ACM
13 years 10 months ago
Dynamic hypertext generation for reusing open corpus content
Adaptive hypermedia systems traditionally focus on providing personalised learning services for formal or informal learners. The learning material is typically sourced from a prop...
Ben Steichen, Séamus Lawless, Alexander O'C...
WABI
2004
Springer
14 years 22 days ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm
BIB
2008
141views more  BIB 2008»
13 years 7 months ago
Detecting short tandem repeats from genome data: opening the software black box
Short tandem repeats, specifically microsatellites, are widely used genetic markers, associated with human genetic diseases, and play an important role in various regulatory mecha...
Angelika Merkel, Neil Gemmell
WSC
1998
13 years 8 months ago
An Analytical Comparison of Optimization Problem Generation Methodologies
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
Raymond R. Hill
AAAI
2004
13 years 8 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...