14774 search results - page 487 / 2955 » Computational complexity and evolutionary computation |
151
click to vote
TGC
2007
Springer
16 years 1 months ago
2007
Springer
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
175
click to vote
WG
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
208
click to vote
FOCS
2006
IEEE
16 years 28 days ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
193
click to vote
FCT
2005
Springer
16 years 12 days ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
188
click to vote
ECOOPW
1999
Springer
15 years 11 months ago
1999
Springer
Impact analysis is seen as an important technique for controlling the evolution of software systems. Numerous approaches have been proposed which aim to assess the impact of chang...