264 search results - page 50 / 53 » On the possibility of faster SAT algorithms |
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
105
click to vote
TPDS
2008
14 years 10 months ago
2008
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
117
click to vote
PAMI
2011
14 years 5 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...