Sciweavers

1651 search results - page 139 / 331
» Measuring the Complexity of Classification Problems
Sort
View
AAAI
2004
13 years 9 months ago
Low-Knowledge Algorithm Control
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
Tom Carchrae, J. Christopher Beck
COR
2008
128views more  COR 2008»
13 years 8 months ago
Search-based software engineering
In the past five years there has been a dramatic increase in work on Search Based Software Engineering (SBSE), an approach to software engineering in which search based optimisatio...
Walter J. Gutjahr, Mark Harman
CVPR
2005
IEEE
14 years 10 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
OTM
2007
Springer
14 years 2 months ago
An Ontology-Driven Architecture for Re-using Semantic Web Services
As more semantic web services become on the Internet, it is feasible that users collaborate among them to save efforts in complex web solutions by sharing and reusing existing sema...
Carlos Granell, Dolores María Llidó,...
ICANN
2010
Springer
13 years 8 months ago
Computational Properties of Probabilistic Neural Networks
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
Jiri Grim, Jan Hora