Sciweavers

2168 search results - page 173 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
UAI
1998
15 years 5 months ago
Hierarchical Solution of Markov Decision Processes using Macro-actions
tigate the use of temporally abstract actions, or macro-actions, in the solution of Markov decision processes. Unlike current models that combine both primitive actions and macro-...
Milos Hauskrecht, Nicolas Meuleau, Leslie Pack Kae...
BIOSYSTEMS
2007
72views more  BIOSYSTEMS 2007»
15 years 4 months ago
On the use of multi-objective evolutionary algorithms for survival analysis
This paper proposes and evaluates a multi-objective evolutionary algorithm for survival analysis. One aim of survival analysis is the extraction of models from data that approxima...
Christian Setzkorn, Azzam Fouad George Taktak, Ber...
MICCAI
2008
Springer
16 years 5 months ago
Segmenting Brain Tumors Using Pseudo-Conditional Random Fields
Locating Brain tumor segmentation within MR (magnetic resonance) images is integral to the treatment of brain cancer. This segmentation task requires classifying each voxel as eith...
Chi-Hoon Lee, Shaojun Wang, Albert Murtha, Matt...
IPPS
2005
IEEE
15 years 10 months ago
Dynamic Reconfiguration of Mechatronic Real-Time Systems Based on Configuration State Machines
Data flow and FSMs are used intensively to specify real-time systems in the field of mechatronics. Their implementation in FPGAs is discussed against the background of dynamic rec...
Steffen Toscher, Roland Kasper, Thomas Reinemann
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 10 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...