Sciweavers

12519 search results - page 201 / 2504
» Approximation Problems Categories
Sort
View
IPSN
2004
Springer
15 years 12 months ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
COMGEO
2010
ACM
15 years 11 months ago
GIRPharma: a geographic information retrieval approach to locate pharmacies on duty
This paper describes an approximation based on geographic information retrieval with the purpose to give some solutions to the problem of searching pharmacies on duty in the Spani...
Francisco M. Rangel Pardo, Loli Rangel Pardo, Davi...
AGENTS
2001
Springer
15 years 11 months ago
Using background knowledge to speed reinforcement learning in physical agents
This paper describes Icarus, an agent architecture that embeds a hierarchical reinforcement learning algorithm within a language for specifying agent behavior. An Icarus program e...
Daniel G. Shapiro, Pat Langley, Ross D. Shachter
COMPGEOM
2005
ACM
15 years 8 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 7 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...