Sciweavers

1941 search results - page 218 / 389
» On the Hardness of Approximate Reasoning
Sort
View
MSR
2010
ACM
15 years 11 months ago
Predicting the severity of a reported bug
—The severity of a reported bug is a critical factor in deciding how soon it needs to be fixed. Unfortunately, while clear guidelines exist on how to assign the severity of a bu...
Ahmed Lamkanfi, Serge Demeyer, Emanuel Giger, Bart...
VISUALIZATION
2002
IEEE
15 years 11 months ago
Direct Surface Extraction from 3D Freehand Ultrasound Images
This paper presents a new technique for the extraction of surfaces from 3D ultrasound data. Surface extraction from ultrasound data is challenging for a number of reasons includin...
Youwei Zhang, Robert Rohling, Dinesh K. Pai
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 10 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
CGI
2003
IEEE
15 years 10 months ago
Reaching Volumes Generated by Means of Octal Trees and Cartesian Constraints
This paper presents a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certa...
I. Rodríguez, Manuel Peinado, Ronan Boulic,...
FLAIRS
2008
15 years 8 months ago
Learning Continuous Action Models in a Real-Time Strategy Environment
Although several researchers have integrated methods for reinforcement learning (RL) with case-based reasoning (CBR) to model continuous action spaces, existing integrations typic...
Matthew Molineaux, David W. Aha, Philip Moore