Sciweavers

805 search results - page 38 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
GLVLSI
1998
IEEE
129views VLSI» more  GLVLSI 1998»
14 years 3 months ago
Tabu Search Based Circuit Optimization
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
Sadiq M. Sait, Habib Youssef, Munir M. Zahra
AAAI
2008
14 years 1 months ago
Personalisation of Telecommunications Services as Combinatorial Optimisation
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important....
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
COCOA
2007
Springer
14 years 5 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
FC
2009
Springer
118views Cryptology» more  FC 2009»
14 years 5 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...
JCST
2008
134views more  JCST 2008»
13 years 11 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li