Sciweavers

202 search results - page 29 / 41
» Complexity of local search for the p-median problem
Sort
View
W2GIS
2004
Springer
14 years 1 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
SMC
2007
IEEE
102views Control Systems» more  SMC 2007»
14 years 2 months ago
An improved immune Q-learning algorithm
—Reinforcement learning is a framework in which an agent can learn behavior without knowledge on a task or an environment by exploration and exploitation. Striking a balance betw...
Zhengqiao Ji, Q. M. Jonathan Wu, Maher A. Sid-Ahme...
ICCV
2009
IEEE
15 years 1 months ago
Multi-Scale Object Detection by Clustering Lines
Object detection in cluttered, natural scenes has a high complexity since many local observations compete for object hypotheses. Voting methods provide an efficient solution to ...
Bjorn Ommer, Jitendra Malik
IC3
2010
13 years 8 months ago
LACAIS: Learning Automata Based Cooperative Artificial Immune System for Function Optimization
Artificial Immune System (AIS) is taken into account from evolutionary algorithms that have been inspired from defensive mechanism of complex natural immune system. For using this ...
Alireza Rezvanian, Mohammad Reza Meybodi
JAIR
2008
130views more  JAIR 2008»
13 years 8 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...