Sciweavers

550 search results - page 89 / 110
» Decision-Theoretic Simulated Annealing
Sort
View
ECAL
2003
Springer
14 years 2 months ago
Critical Values in Asynchronous Random Boolean Networks
Abstract Wherever we see life, we see different kinds of complex networks, reason why they are studied across various fields of science. Random Boolean Networks (RBNs) form a spe...
Bertrand Mesot, Christof Teuscher
INDOCRYPT
2003
Springer
14 years 2 months ago
Improved Cost Function in the Design of Boolean Functions Satisfying Multiple Criteria
We develop an improved cost function to be used in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonli...
Selçuk Kavut, Melek D. Yücel
SPAA
2010
ACM
14 years 2 months ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
CAIP
2001
Springer
293views Image Analysis» more  CAIP 2001»
14 years 1 months ago
A Markov Random Field Image Segmentation Model Using Combined Color and Texture Features
In this paper, we propose a Markov random field (MRF) image segmentation model which aims at combining color and texture features. The theoretical framework relies on Bayesian est...
Zoltan Kato, Ting-Chuen Pong
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
14 years 1 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian