1883 search results - page 183 / 377 » Ordered theta graphs |
PLDI
2006
ACM
14 years 2 months ago
2006
ACM
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
DRMTICS
2005
Springer
14 years 1 months ago
2005
Springer
Software security is a significant issue in the Internet age. In order to prevent software from piracy and unauthorized modification, many techniques have been developed. Softwar...
ISCAS
1999
IEEE
14 years 11 days ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
GECCO
2010
Springer
14 years 3 days ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
APPROX
2006
Springer
13 years 12 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...