Sciweavers

3625 search results - page 245 / 725
» On choosing
Sort
View
COR
2011
15 years 2 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck
CORR
2011
Springer
155views Education» more  CORR 2011»
15 years 2 months ago
On the Zero-Error Capacity Threshold for Deletion Channels
—We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of t...
Ian A. Kash, Michael Mitzenmacher, Justin Thaler, ...
CORR
2011
Springer
157views Education» more  CORR 2011»
15 years 2 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 2 months ago
Using Paxos to Build a Scalable, Consistent, and Highly Available Datastore
Spinnaker is an experimental datastore that is designed to run on a large cluster of commodity servers in a single datacenter. It features key-based range partitioning, 3-way repl...
Jun Rao, Eugene J. Shekita, Sandeep Tata
CORR
2011
Springer
179views Education» more  CORR 2011»
15 years 2 months ago
Cooperative searching for stochastic targets
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution fo...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...