Sciweavers

1887 search results - page 220 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
CP
2003
Springer
14 years 2 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
ICFCA
2007
Springer
14 years 3 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...
ICADL
2003
Springer
117views Education» more  ICADL 2003»
14 years 2 months ago
Metadata++: A Scalable Hierarchical Framework for Digital Libraries
: Metadata++ is a digital library system that we are developing to serve the needs of the United States Department of Agriculture Forest Service, the United States Department of th...
Mathew Weaver, Lois M. L. Delcambre, Timothy Tolle
CIKM
2011
Springer
12 years 9 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
WWW
2007
ACM
14 years 10 months ago
Globetp: template-based database replication for scalable web applications
Generic database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every database replica. The thro...
Tobias Groothuyse, Swaminathan Sivasubramanian, Gu...