Sciweavers

9477 search results - page 1650 / 1896
» Design is as Easy as Optimization
Sort
View
IPCO
1992
112views Optimization» more  IPCO 1992»
15 years 7 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
ATAL
2010
Springer
15 years 7 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
CEC
2010
IEEE
15 years 7 months ago
A mixed strategy for Evolutionary Programming based on local fitness landscape
The performance of Evolutionary Programming (EP) is affected by many factors (e.g. mutation operators and selection strategies). Although the conventional approach with Gaussian mu...
Liang Shen, Jun He
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 7 months ago
Support vector machine classifiers for sequential decision problems
Classification problems in critical applications such as health care or security often require very high reliability because of the high costs of errors. In order to achieve this r...
Eladio Rodriguez Diaz, David A. Castaon
CIDR
2009
159views Algorithms» more  CIDR 2009»
15 years 7 months ago
RIOT: I/O-Efficient Numerical Computing without SQL
R is a numerical computing environment that is widely popular for statistical data analysis. Like many such environments, R performs poorly for large datasets whose sizes exceed t...
Yi Zhang 0011, Herodotos Herodotou, Jun Yang 0001
« Prev « First page 1650 / 1896 Last » Next »