Sciweavers

11716 search results - page 395 / 2344
» Computable symbolic dynamics
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
16 years 1 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
RTA
2007
Springer
16 years 28 days ago
Intruders with Caps
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
Siva Anantharaman, Paliath Narendran, Michaël...
185
Voted
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
16 years 13 days ago
A New Formalism to Characterize Contact States Involving Articulated Polyhedral Objects
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
Ernesto Staffetti, Wim Meeussen, Jing Xiao
CCA
2005
Springer
16 years 11 days ago
Representing Probability Measures using Probabilistic Processes
In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given s...
Matthias Schröder, Alex K. Simpson
DIGRA
2005
Springer
16 years 11 days ago
The Expressions of Colours
A whole world is presented in front of the eyes of a gamer. This world has shapes and colours. What do colours transmit? Is this considered in digital games? These are the main is...
Veronica Zammitto