1568 search results - page 136 / 314 » The problem of examination questions in algorithmics |
134
click to vote
DLOG
2003
15 years 6 months ago
2003
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
132
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
117
Voted
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
167
click to vote
MSWIM
2005
ACM
15 years 10 months ago
2005
ACM
In the last few years, the advance of multimedia applications has prompted researchers to undertake the task of routing multimedia data through Manet. This task is rather difficul...
200
click to vote
SECON
2010
IEEE
15 years 2 months ago
2010
IEEE
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...