Sciweavers

6142 search results - page 597 / 1229
» The Complexity of Partition Functions
Sort
View
DOCENG
2008
ACM
15 years 9 months ago
Configurable editing of XML-based variable-data documents
: Variable data documents can be considered as functions of their bindings to values, and this function could be arbitrarily complex to build strongly-customised but high-value doc...
John Lumley, Roger Gimson, Owen Rees
ICANNGA
2007
Springer
134views Algorithms» more  ICANNGA 2007»
15 years 9 months ago
Optical Design with Epsilon-Dominated Multi-objective Evolutionary Algorithm
Significant improvement over a patented lens design is achieved using multi-objective evolutionary optimization. A comparison of the results obtained from NSGA2 and ε-MOEA is done...
Shaine Joseph, Hyung W. Kang, Uday K. Chakraborty
ADBIS
2010
Springer
136views Database» more  ADBIS 2010»
15 years 8 months ago
New Frontiers in Business Intelligence: Distribution and Personalization
Abstract. To meet the new, more sophisticated needs of decision makers, a new generation of BI systems is emerging. In this paper we focus on two enabling technologies for this new...
Stefano Rizzi
NIPS
2008
15 years 8 months ago
Regularized Policy Iteration
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
NIPS
2007
15 years 8 months ago
Bayesian binning beats approximate alternatives: estimating peri-stimulus time histograms
The peristimulus time histogram (PSTH) and its more continuous cousin, the spike density function (SDF) are staples in the analytic toolkit of neurophysiologists. The former is us...
Dominik Endres, Mike W. Oram, Johannes E. Schindel...