Sciweavers

2490 search results - page 191 / 498
» The Generalized Theory of Model Preference
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 10 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
HYBRID
2010
Springer
16 years 1 months ago
From synchronous programs to symbolic representations of hybrid systems
In this paper, we present an extension of the synchronous language Quartz by new kinds of variables, actions and statements for modeling the interaction of synchronous systems wit...
Kerstin Bauer, Klaus Schneider
ICIAP
2009
ACM
16 years 1 months ago
Towards a Theoretical Framework for Learning Multi-modal Patterns for Embodied Agents
Multi-modality is a fundamental feature that characterizes biological systems and lets them achieve high robustness in understanding skills while coping with uncertainty. Relativel...
Nicoletta Noceti, Barbara Caputo, Claudio Castelli...
LICS
2006
IEEE
16 years 16 days ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
GROUP
2003
ACM
15 years 11 months ago
Communities of action: a cognitive and social approach to the design of CSCW systems
Most current theories about collective cognitive activities in limited groups apply to structurally closed co-operative situations Here we propose to work in the framework of inte...
Manuel Zacklad