Sciweavers

182 search results - page 31 / 37
» Reformulation of Global Constraints in Answer Set Programmin...
Sort
View
86
Voted
ISNN
2005
Springer
15 years 2 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
ISMB
1996
14 years 10 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
JWSR
2007
83views more  JWSR 2007»
14 years 9 months ago
Web Service Discovery and Composition for Virtual Enterprises
: One main characteristic of virtual enterprises are short-term collaborations between business partners to provide efficient and individualized services to customers. The MOVE pro...
Jürgen Dorn, Peter Hrastnik, Albert Rainer
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 1 months ago
Robust Power Allocation for Amplify-and-Forward Relay Networks
Relay power allocation has been shown to provide substantial performance gain in wireless relay networks when perfect global channel state information (CSI) is available. In this p...
Tony Q. S. Quek, Moe Z. Win, Hyundong Shin, Marco ...
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
15 years 3 months ago
A robust detailed placement for mixed-size IC designs
— The rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in recen...
Jason Cong, Min Xie