8512 search results - page 441 / 1703 » Computing Theory With Relevance |
159
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
206
click to vote
ISPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
Scheduling divisible loads in distributed systems is the subject of Divisible Load Theory (DLT). In this paper we show that coalitional game theory is a natural fit for modeling ...
175
click to vote
KESAMSTA
2007
Springer
16 years 1 months ago
2007
Springer
Queueing Theory deals with problems where some restricted resource should be shared between competitive flow of requests. In this paper we use Queueing Theory methods to perform a...
194
click to vote
SARA
2007
Springer
16 years 1 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
182
click to vote
SARA
2007
Springer
16 years 1 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...