7988 search results - page 1006 / 1598 » A Useful Undecidable Theory |
196
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Cooperation between rational users in wireless networks is studied using coalitional game theory. Using the rate achieved by a user as its utility, it is shown that the stable coal...
186
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
230
click to vote
ENTCS
2008
15 years 7 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
188
click to vote
FAC
2008
15 years 7 months ago
2008
The Mondex case study about the specification and refinement of an electronic purse as defined in the Oxford Technical Monograph PRG-126 has recently been proposed as a challenge f...
221
click to vote
IANDC
2008
15 years 7 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...