1998 search results - page 256 / 400 » Complexity of the Cover Polynomial |
160
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
166
click to vote
TCS
2008
15 years 6 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
153
click to vote
BSL
2000
15 years 6 months ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
178
click to vote
CAL
2002
15 years 6 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
159
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...