Sciweavers

1133 search results - page 110 / 227
» Best Practices in e-Assessment
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 6 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
15 years 11 months ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...
ELPUB
2007
ACM
15 years 10 months ago
Openness in Higher Education: Open Source, Open Standards, Open Access
For national advisory services in the UK (UKOLN, CETIS, and OSS Watch), varieties of openness (open source software, open standards, and open access to research publications and d...
Brian Kelly, Scott Wilson, Randy Metcalfe
AAAI
2008
15 years 8 months ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
AAAI
1996
15 years 7 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf