Sciweavers

2084 search results - page 281 / 417
» Set Constraints in Logic Programming
Sort
View
SIAMJO
2010
136views more  SIAMJO 2010»
13 years 3 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ISNN
2005
Springer
14 years 1 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
BIOINFORMATICS
2006
106views more  BIOINFORMATICS 2006»
13 years 8 months ago
Identification of biochemical networks by S-tree based genetic programming
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
Dong-Yeon Cho, Kwang-Hyun Cho, Byoung-Tak Zhang
ISMB
1996
13 years 9 months ago
Refining Neural Network Predictions for Helical Transmembrane Proteins by Dynamic Programming
For transmembrane proteins experimental determina-tion of three-dimensional structure is problematic. However, membrane proteins have important impact for molecular biology in gen...
Burkhard Rost, Rita Casadio, Piero Fariselli
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
13 years 11 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan