Sciweavers

17366 search results - page 90 / 3474
» New Revision Algorithms
Sort
View
FLAIRS
2004
15 years 7 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim
ATAL
2010
Springer
15 years 7 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
ICCV
2009
IEEE
15 years 4 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker
ESANN
2004
15 years 7 months ago
A New Learning Rates Adaptation Strategy for the Resilient Propagation Algorithm
In this paper we propose an Rprop modification that builds on a mathematical framework for the convergence analysis to equip Rprop with a learning rates adaptation strategy that en...
Aristoklis D. Anastasiadis, George D. Magoulas, Mi...
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 11 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno