Sciweavers

4372 search results - page 195 / 875
» Algorithmic Theories of Everything
Sort
View
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
15 years 6 months 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
105
Voted
ATAL
2004
Springer
15 years 6 months ago
Adaptive, Distributed Control of Constrained Multi-Agent Systems
Product Distribution (PD) theory was recently developed as a framework for analyzing and optimizing distributed systems. In this paper we demonstrate its use for adaptive distribu...
Stefan Bieniawski, David Wolpert
ATAL
2001
Springer
15 years 5 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
84
Voted
CP
2008
Springer
15 years 2 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
122
Voted
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 2 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli