9842 search results - page 1563 / 1969 » The Complexity of the Matching-Cut Problem |
205
click to vote
JUCS
2000
15 years 6 months ago
2000
: This paper presents an evaluation of our Scheduled Dataflow (SDF) Processor. Recent focus in the field of new processor architectures is mainly on VLIW (e.g. IA-64), superscalar ...
225
click to vote
SCP
2000
15 years 6 months ago
2000
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
212
click to vote
AC
1998
Springer
15 years 6 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
169
click to vote
IJON
2002
15 years 6 months ago
2002
In this paper I will show how reactive agents can solve relatively complex tasks without requiring any internal state and I will demonstrate that this is due to their ability to c...
228
click to vote
GEOINFORMATICA
1998
15 years 6 months ago
1998
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...