Sciweavers

2182 search results - page 380 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
CP
2005
Springer
15 years 3 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
15 years 2 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
SDM
2010
SIAM
204views Data Mining» more  SDM 2010»
14 years 11 months ago
Scalable Tensor Factorizations with Missing Data
The problem of missing data is ubiquitous in domains such as biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer...
Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda, Mo...
RECOMB
2003
Springer
15 years 10 months ago
On de novo interpretation of tandem mass spectra for peptide identification
The correct interpretation of tandem mass spectra is a difficult problem, even when it is limited to scoring peptides against a database. De novo sequencing is considerably harder...
Vineet Bafna, Nathan Edwards
TMC
2012
13 years 5 days ago
Relay-Assisted Transmission with Fairness Constraint for Cellular Networks
Abstract—We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a propo...
Erwu Liu, Qinqing Zhang, Kin K. Leung