1199 search results - page 50 / 240 » Automated Extraction of Problem Structure |
CP
2006
Springer
14 years 23 days ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
MVA
2010
13 years 7 months ago
2010
An approach for rapid, automatic detection of plant roots in minirhizotron images is presented. The problem is modeled as a Gibbs point process with a modified Candy model, in wh...
ICLP
1997
Springer
14 years 18 days ago
1997
Springer
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
ECSQARU
2007
Springer
14 years 3 months ago
2007
Springer
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of evaluation of decisions are often bipolar. The aim of this ...