8497 search results - page 1523 / 1700 » Design for an Optimal Probe |
160
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
186
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
187
click to vote
EDCC
2010
Springer
15 years 11 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
186
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
An important goal for the generative and developmental systems (GDS) community is to show that GDS approaches can compete with more mainstream approaches in machine learning (ML)....
184
click to vote
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...