Sciweavers

4426 search results - page 846 / 886
» Concurrent Constraint Programming
Sort
View
BMCBI
2010
108views more  BMCBI 2010»
15 years 4 months ago
Confronting two-pair primer design for enzyme-free SNP genotyping based on a genetic algorithm
Background: Polymerase chain reaction with confronting two-pair primers (PCR-CTPP) method produces allelespecific DNA bands of different lengths by adding four designed primers an...
Cheng-Hong Yang, Yu-Huei Cheng, Li-Yeh Chuang, Hsu...
BMCBI
2005
162views more  BMCBI 2005»
15 years 4 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes
TWC
2008
120views more  TWC 2008»
15 years 3 months ago
Binary Power Control for Sum Rate Maximization over Multiple Interfering Links
We consider allocating the transmit powers for a wireless multi-link (N-link) system, in order to maximize the total system throughput under interference and noise impairments, and...
Anders Gjendemsjø, David Gesbert, Geir E. &...
TON
2002
144views more  TON 2002»
15 years 3 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
LATIN
2010
Springer
15 years 2 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen