Sciweavers

246 search results - page 11 / 50
» Dynamic Local Search for the Maximum Clique Problem
Sort
View
AAAI
1997
15 years 1 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
NIPS
2007
15 years 1 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
ICCV
2009
IEEE
16 years 4 months ago
A Theory of Active Object Localization
We present some theoretical results related to the problem of actively searching for a target in a 3D environment, under the constraint of a maximum search time. We define the o...
Alexander Andreopoulos, John K. Tsotsos
TKDE
2008
195views more  TKDE 2008»
14 years 11 months ago
Learning a Maximum Margin Subspace for Image Retrieval
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap...
Xiaofei He, Deng Cai, Jiawei Han
ICCS
2004
Springer
15 years 5 months ago
Local Search with Congestion in Complex Communication Networks
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
Alex Arenas, Leon Danon, Albert Díaz-Guiler...