Search Results - subject:"Algorithms"

Machine Vision Algorithms in Java: Techniques and Implementation

Rigelsford, Jon - In: Industrial Robot: An International Journal 28 (2001) 4

Persistent link: https://www.econbiz.de/10014833769

Evolutionary Robotics: The Biology, Intelligence, and Technology of Self-organising Machines

Rigelsford, Jon - In: Industrial Robot: An International Journal 28 (2001) 4

Persistent link: https://www.econbiz.de/10014833770

Algorithmic and Computational Robotics: New Directions

Rigelsford, Jon - In: Industrial Robot: An International Journal 28 (2001) 6

Persistent link: https://www.econbiz.de/10014833853

Tiling Groups for Wang Tiles

Moore, Cristopher; Rapaport, Ivan; Rémila, Eric - Santa Fe Institute - 2001

efficient algorithms that tell whether a given region with colored boundary is tileable, show how to sample random tilings, and …

Persistent link: https://www.econbiz.de/10005623662

Almost All Graphs of Degree 4 are 3-colorable

Achlioptas, Dimitris; Moore, Cristopher - Santa Fe Institute - 2001

in analyzing the performance of heuristics on random graph instances. However, only a small family of algorithms can … distributions and in conjunction with general graph algorithms that have a preference for high- or low-degree vertices. …

Persistent link: https://www.econbiz.de/10005739919

Stability in coalition formation games

Romero-Medina, Antonio; Katari´na Cechlárová - In: International Journal of Game Theory 29 (2001) 4, pp. 487-494

In the context of coalition formation games a player evaluates a partition on the basis of the set she belongs to. For this evaluation to be possible, players are supposed to have preferences over sets to which they could belong. In this paper, we suggest two extensions of preferences over...

Persistent link: https://www.econbiz.de/10005598435

Fast Approximation Algorithms for Finding Node-Independent Paths in Networks

White, Douglas R.; Newman, M. E. J. - Santa Fe Institute - 2001

A network is robust to the extent that it is not vulnerable to disconnection by removal of nodes. The minimum number of nodes that need be removed to disconnect a pair of other nodes is called the connectivity of the pair. It can be proved that the connectivity is also equal to the number of...

Persistent link: https://www.econbiz.de/10005790851

Genetic Algorithms in Portfolio Optimization

Chi-Cheong - Society for Computational Economics - SCE - 2001

-off should be made between the performance and the computational time. Hence, we use Genetic Algorithms (GA) as our self … of other search algorithms, GA is less problem-dependent while the others like Tabu Search is systematic and strategic … towards the problem. In comparison of other local search algorithms, GA reassures a higher chance of reaching a global optimum …

Persistent link: https://www.econbiz.de/10005706718

Studying Real Options with Genetic Algorithms

Balmann, Alfons; Musshoff, Oliver - Society for Computational Economics - SCE - 2001

paper is to present and to discuss genetic algorithms (GA) as an alternative to analytical approaches for studying real …

Persistent link: https://www.econbiz.de/10005706742

Complex dynamics and adaptive fuzzy rule-based expectations - economic simulations with GENEFER

Kooths, Stefan; Ringhut, Eric - Society for Computational Economics - SCE - 2001

On last yearÌs conference in Barcelona the authors presented an innovative expectation formation hypothesis. The assumption of fully rational agents is rejected and replaced by a bounded rationality approach that is modelled by means of a fuzzy rule-base. These rules as well as their components...

Persistent link: https://www.econbiz.de/10005706748