Sciweavers

2266 search results - page 153 / 454
» Some Solutions to the Ignoring Problem
Sort
View
AIIA
1991
Springer
15 years 10 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
ICVGIP
2004
15 years 8 months ago
On Learning Shapes from Shades
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
Subhajit Sanyal, Mayank Bansal, Subhashis Banerjee...
CEC
2010
IEEE
15 years 7 months ago
Elitist Artificial Bee Colony for constrained real-parameter optimization
Abstract-- A novel algorithm to solve constrained realparameter optimization problems, based on the Artificial Bee Colony algorithm is introduced in this paper. The operators used ...
Efrén Mezura-Montes, Ramiro Ernesto Velez-K...
CEC
2010
IEEE
15 years 7 months ago
Smart flight and dynamic tolerances in the artificial bee colony for constrained optimization
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
Efrén Mezura-Montes, Mauricio Damian-Araoz,...
ENTCS
2008
94views more  ENTCS 2008»
15 years 6 months ago
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...
Hendrik Tews, Tjark Weber, Marcus Völp