2100 search results - page 98 / 420 » Fundamentals of the problem |
201
click to vote
AIIA
1991
Springer
15 years 10 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
154
click to vote
INFORMATICALT
2010
15 years 4 months ago
2010
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veriï...
164
click to vote
CLASSIFICATION
2006
15 years 6 months ago
2006
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
175
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space...
177
click to vote
IFIP12
2009
15 years 4 months ago
2009
We outline a method to model customer behavior from retail transaction data. In particular, we focus on the problem of recommending relevant products to consumers. Addressing this ...