1568 search results - page 15 / 314 » The problem of examination questions in algorithmics |
TAINN
2005
Springer
14 years 27 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
JALC
2002
13 years 7 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
JSW
2007
13 years 7 months ago
2007
— The anomaly-based intrusion detection systems examine current system activity do find deviations from normal system activity. The present paper proposes a method for normal act...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
—In this paper we consider the behaviour of both primal and dual multi-path algorithms for a simple network of three resources. We examine the equilibrium behaviour of our models...
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
One useful feature that is missing from today’s database systems is an explain capability that enables users to seek clarifications on unexpected query results. There are two t...