920 search results - page 102 / 184 » Generating Satisfiable Problem Instances |
120
Voted
AAAI
2006
15 years 2 months ago
2006
In this paper, we discuss how our work on evaluating Semantic Web knowledge base systems (KBSs) contributes to address some broader AI problems. First, we show how our approach pr...
106
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
85
Voted
IPL
2007
15 years 19 days ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
119
Voted
ADC
2003
Springer
15 years 6 months ago
2003
Springer
This paper proposes a novel way of automatically developing data warehouse configuration in rule-based CRM systems. Rule-based CRM systems assume that marketing activities are re...
111
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
We consider the problem of predicting a sequence of real-valued multivariate states from a given measurement sequence. Its typical application in computer vision is the task of mo...