9736 search results - page 86 / 1948 » How Fast Can We Compute Products |
131
click to vote
MANSCI
2008
15 years 4 months ago
2008
We introduce callable products into a finite-capacity, two-period sales or booking process where low-fare customers book first. A callable product is a unit of capacity sold at th...
229
click to vote
ASPLOS
2009
ACM
16 years 5 months ago
2009
ACM
Abstract: Modeling the interactions of biological molecules, or docking, is critical to both understanding basic life processes and to designing new drugs. Here we describe the GPU...
173
click to vote
AOSD
2011
ACM
14 years 11 months ago
2011
ACM
A Software Product Line (SPL) is a family of programs where each program is defined by a unique combination of features. Testing or checking properties of an SPL is hard as it ma...
147
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
148
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...