4342 search results - page 96 / 869 » Improved Algorithms for Optimal Embeddings |
138
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
183
Voted
ISVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
The behavior of many algorithms is heavily determined by the input data. Furthermore, this often means that multiple and completely different execution paths can be followed, also...
156
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
143
click to vote
AFRICACRYPT
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
157
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...