Sciweavers

2600 search results - page 237 / 520
» Clustering with or without the Approximation
Sort
View
172
Voted
AAAI
2006
15 years 8 months ago
Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
Yaxin Liu, Sven Koenig
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 7 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 7 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
CPHYSICS
2007
100views more  CPHYSICS 2007»
15 years 6 months ago
Dielectric anisotropy in the GW space-time method
Excited-state calculations, notably for quasiparticle band structures, are nowadays routinely performed within the GW approximation for the electronic self-energy. Nevertheless, c...
Christoph Freysoldt, Philipp Eggert, Patrick Rinke...
JSAC
2006
103views more  JSAC 2006»
15 years 6 months ago
Performance analysis of M-ary PPM TH-UWB systems in the presence of MUI and timing jitter
The symbol error probability (SEP) performance of time-hopping (TH) ultra-wideband (UWB) systems in the presence of multiuser interference (MUI) and timing jitter is considered wit...
N. V. Kokkalis, P. Takis Mathiopoulos, George K. K...