Sciweavers

1568 search results - page 39 / 314
» The problem of examination questions in algorithmics
Sort
View
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 3 months ago
Comparing Discrete and Continuous Genotypes on the Constrained Portfolio Selection Problem
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
Felix Streichert, Holger Ulmer, Andreas Zell
ADCM
2008
111views more  ADCM 2008»
14 years 10 months ago
Sigma-delta quantization errors and the traveling salesman problem
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
Yang Wang
ICML
2000
IEEE
15 years 11 months ago
Convergence Problems of General-Sum Multiagent Reinforcement Learning
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
Michael H. Bowling
CSFW
2010
IEEE
15 years 2 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin
DM
2006
76views more  DM 2006»
14 years 10 months ago
Lex M versus MCS-M
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
Yngve Villanger