14165 search results - page 453 / 2833 » The generalized two-server problem |
169
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
159
Voted
ICFCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finit...
192
click to vote
COLT
2005
Springer
16 years 12 days ago
2005
Springer
We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of fitting a matrix with matrices having low complexity. We present generali...
174
Voted
KES
2005
Springer
16 years 11 days ago
2005
Springer
We present a simple, yet general top-down query answering procedure for logic programs managing uncertainty. The main features are: (i) the certainty values are taken from a certai...
153
click to vote
STACS
2004
Springer
16 years 6 days ago
2004
Springer
We consider metrical task systems, a general framework to model online problems. Borodin, Linial and Saks [BLS92] presented a deterministic work function algorithm (WFA) for metric...