Sciweavers

8824 search results - page 98 / 1765
» On the Complexity of Real Functions
Sort
View
AROBOTS
2004
119views more  AROBOTS 2004»
15 years 4 months ago
Swarm-Bot: A New Distributed Robotic Concept
The swarm intelligence paradigm has proven to have very interesting properties such as robustness, flexibility and ability to solve complex problems exploiting parallelism and self...
Francesco Mondada, Giovanni C. Pettinaro, Andr&eac...
VIS
2006
IEEE
117views Visualization» more  VIS 2006»
16 years 5 months ago
Transfer Function Fusing
Based on the observation that it is relatively easier for users to generate several good transfer functions (TFs) for different features of volumetric data, we propose TF fusing, ...
Yingcai Wu, Huamin Qu, Hong Zhou, Ming-Yuen Cha...
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 2 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
GECCO
2000
Springer
15 years 7 months ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
Shigeyoshi Tsutsui
FOCS
1991
IEEE
15 years 7 months ago
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál