Sciweavers

673 search results - page 68 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 7 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 7 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
CPAIOR
2009
Springer
14 years 2 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
ASPDAC
2006
ACM
134views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Constraint driven I/O planning and placement for chip-package co-design
System-on-chip and system-in-package result in increased number of I/O cells and complicated constraints for both chip designs and package designs. This renders the traditional ma...
Jinjun Xiong, Yiu-Chung Wong, Egino Sarto, Lei He
COCOA
2007
Springer
14 years 1 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle