Sciweavers

1940 search results - page 272 / 388
» Graph Transformation with Variables
Sort
View
JCP
2008
135views more  JCP 2008»
15 years 6 months ago
Hybrid Evolutionary Algorithm Based Solution for Register Allocation for Embedded Systems
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
Anjali Mahajan, M. S. Ali
RSA
2002
71views more  RSA 2002»
15 years 6 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski
RSA
2008
80views more  RSA 2008»
15 years 5 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman
ICCV
2009
IEEE
15 years 4 months ago
Minimizing energy functions on 4-connected lattices using elimination
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...
Peter Carr, Richard Hartley
DCC
2011
IEEE
15 years 1 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev