4913 search results - page 225 / 983 » Results and Perspectives of the G |
162
click to vote
CIE
2007
Springer
16 years 24 days ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
134
click to vote
CIE
2007
Springer
16 years 24 days ago
2007
Springer
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
172
click to vote
EUROGP
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
158
click to vote
DSD
2005
IEEE
16 years 7 days ago
2005
IEEE
In this paper we study the timing behaviour of streaming applications running on a multiprocessor architecture. Dependencies are derived between the application throughput and the...
175
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...