1941 search results - page 85 / 389 » On the Hardness of Approximate Reasoning |
STOC
2006
ACM
16 years 6 days ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
RSFDGRC
2005
Springer
15 years 5 months ago
2005
Springer
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
RTCSA
2008
IEEE
15 years 6 months ago
2008
IEEE
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...