Sciweavers

1795 search results - page 152 / 359
» Search by strategy
Sort
View
AIPS
2007
15 years 9 months ago
Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling
Many scheduling problems reside in uncertain and dynamic environments – tasks have a nonzero probability of failure and may need to be rescheduled. In these cases, an optimized ...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
CIKM
2008
Springer
15 years 9 months ago
Passage relevance models for genomics search
We present a passage relevance model for integrating syntactic and semantic evidence of biomedical concepts and topics using a probabilistic graphical model. Component models of t...
Jay Urbain, Ophir Frieder, Nazli Goharian
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
16 years 8 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
ATAL
2007
Springer
16 years 1 months ago
Unifying distributed constraint algorithms in a BDI negotiation framework
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
Bao Chau Le Dinh, Kiam Tian Seow
SIGIR
2006
ACM
16 years 1 months ago
Formal models for expert finding in enterprise corpora
Searching an organization’s document repositories for experts provides a cost effective solution for the task of expert finding. We present two general strategies to expert se...
Krisztian Balog, Leif Azzopardi, Maarten de Rijke