53 search results - page 10 / 11 » Backdoors to Combinatorial Optimization: Feasibility and Opt... |
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
ISSRE
2003
IEEE
13 years 10 months ago
2003
IEEE
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
COR
2010
13 years 5 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
COR
2006
13 years 5 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
EAAI
2007
13 years 5 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...