Sciweavers

8486 search results - page 138 / 1698
» Ordered Enumeration Method
Sort
View
107
Voted
CIKM
2008
Springer
15 years 2 months ago
Retrievability: an evaluation measure for higher order information access tasks
Evaluation in Information Retrieval (IR) has long focused on effectiveness and efficiency. However, new and emerging access tasks now demand alternative evaluation measures which ...
Leif Azzopardi, Vishwa Vinay
GRAPHICSINTERFACE
2008
15 years 2 months ago
Order and entropy in picture passwords
Previous efforts involving picture-based passwords have not focused on maintaining a measurably high level of entropy. Since password systems usually allow user selection of passw...
Saranga Komanduri, Dugald Ralph Hutchings
79
Voted
AAAI
1994
15 years 2 months ago
Derivation Replay for Partial-Order Planning
Derivation replay was first proposed by Carbonell as a method of transferring guidancefrom a previousproblemsolving episode to a new one. Subsequent implementations have used stat...
Laurie H. Ihrig, Subbarao Kambhampati
94
Voted
AI
2006
Springer
15 years 26 days ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
123
Voted
JFP
2008
125views more  JFP 2008»
15 years 23 days ago
Types and trace effects of higher order programs
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
Christian Skalka, Scott F. Smith, David Van Horn