Sciweavers

2477 search results - page 22 / 496
» Approximate extended formulations
Sort
View
JCC
2007
131views more  JCC 2007»
13 years 7 months ago
An extended dead-end elimination algorithm to determine gap-free lists of low energy states
: Proteins are flexible systems and commonly populate several functionally important states. To understand protein function, these states and their energies have to be identified...
Edda Kloppmann, G. Matthias Ullmann, Torsten Becke...
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 9 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
ESWS
2007
Springer
14 years 1 months ago
SPARQLeR: Extended Sparql for Semantic Association Discovery
Complex relationships, frequently referred to as semantic associations, are the essence of the Semantic Web. Query and retrieval of semantic associations has been an important task...
Krys Kochut, Maciej Janik
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 1 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
ICLP
1990
Springer
13 years 11 months ago
Extending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
Remo Pareschi, Dale Miller