844 search results - page 92 / 169 » Solving the p |
146
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we first explore the group theoretic techniques developed for graph isomorphism. We specifically discuss the techniques developed by Luks for solving constrained v...
125
click to vote
FCCM
2000
IEEE
15 years 10 months ago
2000
IEEE
For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining hi...
148
click to vote
COCOON
2000
Springer
15 years 10 months ago
2000
Springer
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
151
click to vote
ICDCS
1998
IEEE
15 years 10 months ago
1998
IEEE
Market mechanisms solve distributed scheduling problems by allocating the scheduled resources according to market prices. We model distributed scheduling as a discrete resource al...
134
click to vote
ICRA
1998
IEEE
15 years 10 months ago
1998
IEEE
Signi cant advances have been made in the area of macro planning for assembly operations i.e., dividing a product into sub-assemblies, determining the sequence of assembly operati...