1701 search results - page 117 / 341 » Computer Science and State Machines |
CSR
2006
Springer
15 years 1 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
STACS
2000
Springer
15 years 1 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
GI
2010
Springer
14 years 8 months ago
2010
Springer
: Information needs like searching scientific literature that involve high recall rates are difficult to satisfy with ad hoc keyword search. We propose to state queries implicitl...
DLT
2009
14 years 7 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
106
click to vote
ENC
2008
IEEE
15 years 4 months ago
2008
IEEE
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...