1450 search results - page 42 / 290 » On the Complexity of Hardness Amplification |
AI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Choosing between multiple alternative tasks is a hard problem for agents evolving in an uncertain real-time multiagent environment. An example of such environment is the ...
FCT
2003
Springer
14 years 28 days ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
ISAAC
2001
Springer
14 years 5 days ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
SAT
2010
Springer
13 years 11 months ago
2010
Springer
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...