Sciweavers

2157 search results - page 292 / 432
» Binary ant algorithm
Sort
View
161
Voted
COCOON
2010
Springer
15 years 8 months ago
A Three-String Approach to the Closest String Problem
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
Zhi-Zhong Chen, Bin Ma, Lusheng Wang
ESANN
2006
15 years 6 months ago
Classification by means of Evolutionary Response Surfaces
Abstract. Response surfaces are a powerful tool for both classification and regression as they are able to model many different phenomena and construct complex boundaries between c...
Rafael del Castillo Gomariz, Nicolás Garc&i...
WAE
1998
118views Algorithms» more  WAE 1998»
15 years 6 months ago
Guarding Scenes against Invasive Hypercubes
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 3 months ago
RoboCast: Asynchronous Communication in Robot Networks
Abstract. This paper introduces the RoboCast communication abstraction. The RoboCast allows a swarm of non oblivious, anonymous robots that are only endowed with visibility sensors...
Zohir Bouzid, Shlomi Dolev, Maria Potop-Butucaru, ...
IPL
2010
114views more  IPL 2010»
15 years 3 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer