Sciweavers

5316 search results - page 122 / 1064
» Which Search Problems Are Random
Sort
View
ECAI
2004
Springer
15 years 8 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
ICC
2007
IEEE
142views Communications» more  ICC 2007»
15 years 9 months ago
Turbo Codes Based Image Transmission for Channels with Both Random Errors and Packet Loss
Abstract— In this paper, we propose an unequal error protection (UEP) framework for progressive image transmission over wireless networks with both random errors and packet loss....
Lei Yao, Lei Cao
133
Voted
ICML
1994
IEEE
15 years 7 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
135
Voted
GEOINFORMATICA
2002
136views more  GEOINFORMATICA 2002»
15 years 3 months ago
Tabu Search Heuristic for Point-Feature Cartographic Label Placement
The generation of better label placement configurations in maps is a problem that comes up in automated cartographic production. The objective of a good label placement is to displ...
Missae Yamamoto, Gilberto Câmara, Luiz Anton...
144
Voted
MIA
2010
170views more  MIA 2010»
14 years 10 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...