Sciweavers

1712 search results - page 199 / 343
» A Computational Approach to Binding Theory
Sort
View
AAAI
2000
15 years 3 months ago
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
Kagan Tumer, David Wolpert
AROBOTS
2007
81views more  AROBOTS 2007»
15 years 2 months ago
Mobile robot team forming for crystallization of proteins
The process of protein crystallization is explained using the theory of robotics, particularly path planning of mobile robots. Path planning is a procedure which specifies motion ...
Yuan F. Zheng, Weidong Chen
ENTCS
2006
142views more  ENTCS 2006»
15 years 1 months ago
Specialization of Interaction Protocols in a Temporal Action Logic
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...
Laura Giordano, Alberto Martelli, Camilla Schwind
JMIV
2008
106views more  JMIV 2008»
15 years 1 months ago
Estimation of Vector Fields in Unconstrained and Inequality Constrained Variational Problems for Segmentation and Registration
Vector fields arise in many problems of computer vision, particularly in non-rigid registration. In this paper, we develop coupled partial differential equations (PDEs) to estimat...
Gozde B. Unal, Greg G. Slabaugh
CVIU
2007
125views more  CVIU 2007»
15 years 1 months ago
Graph regularization for color image processing
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...
Olivier Lezoray, Abderrahim Elmoataz, Sébas...