Sciweavers

594 search results - page 91 / 119
» Heuristic Measures of Interestingness
Sort
View
CP
2006
Springer
14 years 17 days ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan
CICLING
2010
Springer
14 years 15 days ago
Selecting the N-Top Retrieval Result Lists for an Effective Data Fusion
Although the application of data fusion in information retrieval has yielded good results in the majority of the cases, it has been noticed that its achievement is dependent on the...
Antonio Juárez-González, Manuel Mont...
PATAT
2000
Springer
123views Education» more  PATAT 2000»
14 years 12 days ago
A Multicriteria Approach to Examination Timetabling
The main aim of this paper is to consider university examination timetabling problems as multicriteria decision problems. A new multicriteria approach to solving such problems is p...
Edmund K. Burke, Yuri Bykov, Sanja Petrovic
ECCV
2010
Springer
14 years 8 days ago
Optimal Contour Closure by Superpixel Grouping
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
AAAI
2008
13 years 11 months ago
Reinforcement Learning for Vulnerability Assessment in Peer-to-Peer Networks
Proactive assessment of computer-network vulnerability to unknown future attacks is an important but unsolved computer security problem where AI techniques have significant impact...
Scott Dejmal, Alan Fern, Thinh Nguyen