4171 search results - page 793 / 835 » Choice numbers of graphs |
147
click to vote
TC
2011
14 years 6 months ago
2011
—Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Since a large fraction of chip area is devoted to on-...
102
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
124
click to vote
CEC
2011
IEEE
13 years 11 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
169
click to vote
DC
2011
13 years 11 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...