1176 search results - page 37 / 236 » Implicit Abstraction Heuristics |
ECML
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The area under the ROC curve (AUC) has been widely used to measure ranking performance for binary classification tasks. AUC only employs the classifier’s scores to ra...
AI
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
COMPSAC
2004
IEEE
14 years 1 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
CSMR
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract--Concept or feature identification, i.e., the identification of the source code fragments implementing a particular feature, is a crucial task during software understandin...