Sciweavers

292 search results - page 14 / 59
» Are Stable Instances Easy
Sort
View
CGF
2006
151views more  CGF 2006»
15 years 23 days ago
Topological Structures in Two-Parameter-Dependent 2D Vector Fields
In this paper we extract and visualize the topological skeleton of two-parameter-dependent vector fields. This kind of vector data depends on two parameter dimensions, for instanc...
Tino Weinkauf, Holger Theisel, Hans-Christian Hege...
110
Voted
BCS
2008
15 years 2 months ago
A Hardware Relaxation Paradigm for Solving NP-Hard Problems
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
Paul Cockshott, Andreas Koltes, John O'Donnell, Pa...
138
Voted
FOSSACS
2004
Springer
15 years 6 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
97
Voted
BMCBI
2008
104views more  BMCBI 2008»
15 years 25 days ago
Evolutionary Pareto-optimization of stably folding peptides
Background: As a rule, peptides are more flexible and unstructured than proteins with their substantial stabilizing hydrophobic cores. Nevertheless, a few stably folding peptides ...
Wolfram Gronwald, Tim Hohm, Daniel Hoffmann
135
Voted
AAIP
2009
14 years 10 months ago
Deriving a Relationship from a Single Example
Given an appropriate domain specific language (DSL), it is possible to describe the relationship between Haskell data types and many generic functions, typically type-class instan...
Neil Mitchell