Sciweavers

42230 search results - page 8397 / 8446
» Algorithms and Complexity Results for
Sort
View
AMAI
1999
Springer
13 years 8 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 8 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
MP
1998
136views more  MP 1998»
13 years 8 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
13 years 8 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
SIGIR
2002
ACM
13 years 8 months ago
Two-stage language models for information retrieval
The optimal settings of retrieval parameters often depend on both the document collection and the query, and are usually found through empirical tuning. In this paper, we propose ...
ChengXiang Zhai, John D. Lafferty
« Prev « First page 8397 / 8446 Last » Next »