Sciweavers

2778 search results - page 494 / 556
» Limit complexities revisited
Sort
View
AMAI
2004
Springer
15 years 11 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
CCS
2004
ACM
15 years 11 months ago
On the effectiveness of address-space randomization
Address-space randomization is a technique used to fortify systems against bu er over ow attacks. The idea is to introduce arti cial diversity by randomizing the memory location o...
Hovav Shacham, Matthew Page, Ben Pfaff, Eu-Jin Goh...
EGH
2004
Springer
15 years 11 months ago
A programmable vertex shader with fixed-point SIMD datapath for low power wireless applications
The real time 3D graphics becomes one of the attractive applications for 3G wireless terminals although their battery lifetime and memory bandwidth limit the system resources for ...
Ju-Ho Sohn, Ramchan Woo, Hoi-Jun Yoo
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
15 years 11 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai
GISCIENCE
2004
Springer
130views GIS» more  GISCIENCE 2004»
15 years 11 months ago
Comparing Exact and Approximate Spatial Auto-regression Model Solutions for Spatial Data Analysis
The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions f...
Baris M. Kazar, Shashi Shekhar, David J. Lilja, Ra...