492 search results - page 44 / 99 » The number of possibilities for random dating |
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
DATE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—On-chip interconnection network is a crucial design component in high-performance System-on-Chips (SoCs). Many of previous works have focused on the automation of its to...
ICML
2006
IEEE
15 years 11 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
GLOBECOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— In this work, we study the topology enhancement problem of wireless sensor networks. Our research focuses on reducing the path-based vulnerability. The objective is to get as m...