5316 search results - page 299 / 1064 » Which Search Problems Are Random |
164
click to vote
ESWA
2007
15 years 5 months ago
2007
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
185
click to vote
CCCG
2009
15 years 7 months ago
2009
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
147
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown number of sensors have been reprogrammed by a...
145
Voted
ASUNAM
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
156
Voted
CCR
2006
15 years 6 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...