14774 search results - page 279 / 2955 » Computational complexity and evolutionary computation |
161
click to vote
GBRPR
2009
Springer
15 years 11 months ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
171
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper addresses an optimal technique for throughput optimization of general non-linear data flow computations using a set of transformations. Throughput is widely recognized ...
164
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
173
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
196
click to vote
DSVIS
2006
Springer
15 years 10 months ago
2006
Springer
The development of video games is a complex software engineering activity bringing together large multidisciplinary teams under stringent constraints. While much has been written a...