2109 search results - page 30 / 422 » Solving Necklace Constraint Problems |
104
click to vote
MP
2007
15 years 3 months ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
164
click to vote
ICCBR
2009
Springer
15 years 2 months ago
2009
Springer
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
120
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...
144
click to vote
LICS
2003
IEEE
15 years 9 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
125
click to vote
ENDM
2010
15 years 1 months ago
2010
This paper deals with an NP-hard bi-objective one-machine problem with ready times involving maximum lateness and unit family setup cost objectives. Considering separately both ob...