Sciweavers

254 search results - page 42 / 51
» Binary amiable Words
Sort
View
99
Voted
4OR
2004
63views more  4OR 2004»
15 years 18 days ago
A note on robust 0-1 optimization with uncertain cost coefficients
Abstract. Based on the recent approach of Bertsimas and Sim (2004, 2003) to robust optimization in the presence of data uncertainty, we prove an easily computable and simple bound ...
Mustafa Ç. Pinar
JUCS
2007
137views more  JUCS 2007»
15 years 18 days ago
An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
Fangmin Dong, Renbin Xiao, Yifang Zhong, Yong Liu
82
Voted
ALGORITHMICA
2000
65views more  ALGORITHMICA 2000»
15 years 16 days ago
A Simultaneous Search Problem
We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x, y [0, 1] with as little uncertain...
Ee-Chien Chang, Chee-Keng Yap
IJAC
2000
104views more  IJAC 2000»
15 years 15 days ago
Construction of Self-Distributive Operations and Charged Braids
Starting from a certain monoid that describes the geometry of the left self-distributivity identity, we construct an explicit realization of the free left self-distributive system ...
Patrick Dehornoy
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 11 days ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer