Estimating the difficulty of Tartarus instances
نویسندگان
چکیده
منابع مشابه
Estimating Image Segmentation Difficulty
The heavy use of camera phones and other mobile devices all over the world has produced a market for mobile image analysis, including image segmentation to separate out objects of interest. Automatic image segmentation algorithms, when employed by many different users for multiple applications, cannot guarantee high quality results. Yet interactive algorithms require human effort that may becom...
متن کاملEstimating the Perceived Difficulty of Pen Gestures
Our empirical results show that users perceive the execution difficulty of single stroke gestures consistently, and execution difficulty is highly correlated with gesture production time. We use these results to design two simple rules for estimating execution difficulty: establishing the relative ranking of difficulty among multiple gestures; and classifying a single gesture into five levels o...
متن کاملthe relationship between test-takers and experts perception of prompt difficulty
چکیده مهارت شنیداری برای مدتهای طولانی در آموزش ، تحقیق و ارزیابی مورد غفلت قرار گرفته است. اگرچه در سالهای اخیر به خاطر اهمیت قابل ملاحظه این توانائیها در آموزش و آزمون زبان ، توجه بیشتری به توانائیهای شنیداری شده است. هم چنانکه درک شنیداری در آموزش و ارزیابی زبان دوم اهمیت فزاینده ای می یابد محققین سعی نموده اند تا ماهیت مهارتهای مستتر در مهارت شنیداری را مورد بررسی و مطالعه قرار دهند. هدف ...
15 صفحه اولUnderstanding TSP Difficulty by Learning from Evolved Instances
Whether the goal is performance prediction, or insights into the relationships between algorithm performance and instance characteristics, a comprehensive set of meta-data from which relationships can be learned is needed. This paper provides a methodology to determine if the meta-data is sufficient, and demonstrates the critical role played by instance generation methods. Instances of the Trav...
متن کاملEstimating the Number of Local Maxima for k-SAT Instances
We explore the applicability of a sampling method devised by J. Garnier and L. Kallel (SIAM J. Discrete Math., 2002) to approximate the number of local maxima in search spaces induced by k-SAT instances and a simple neighbourhood relation. The objective function is given by the number of satisfied clauses. Although the problem setting for k-SAT instances does not meet all pre-conditions require...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pamukkale University Journal of Engineering Sciences
سال: 2021
ISSN: 1300-7009
DOI: 10.5505/pajes.2020.00515