Sciweavers

1626 search results - page 182 / 326
» Hybrid computing algorithm in representing solid model
Sort
View
SAC
2010
ACM
15 years 10 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
COR
2008
99views more  COR 2008»
15 years 3 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
IEEEPACT
2005
IEEE
15 years 9 months ago
Exploiting Coarse-Grained Parallelism to Accelerate Protein Motif Finding with a Network Processor
While general-purpose processors have only recently employed chip multiprocessor (CMP) architectures, network processors (NPs) have used heterogeneous multi-core architectures sin...
Ben Wun, Jeremy Buhler, Patrick Crowley
CVPR
2011
IEEE
14 years 11 months ago
Discrete-Continuous Optimization for Large-scale Structure from Motion
Recent work in structure from motion (SfM) has successfully built 3D models from large unstructured collections of images downloaded from the Internet. Most approaches use increme...
David Crandall, Andrew Owens, Noah Snavely, Daniel...
121
Voted
ACMSE
2008
ACM
15 years 5 months ago
Optimization of the multiple retailer supply chain management problem
With stock surpluses and shortages representing one of the greatest elements of risk to wholesalers, a solution to the multiretailer supply chain management problem would result i...
Caio Soares, Gerry V. Dozier, Emmett Lodree, Jared...