5624 search results - page 578 / 1125 » On Conditional Covering Problem |
211
click to vote
DIALM
2005
ACM
15 years 9 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
168
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals ...
133
click to vote
AAAI
2010
15 years 8 months ago
2010
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u ca...
EUSFLAT
2007
15 years 8 months ago
2007
The research in the field of the so called Fuzzy Mathematics can be conditionally devided into two mainstreams: the first one emphasizes on the study of different fuzzy structu...
175
click to vote
NIPS
2007
15 years 8 months ago
2007
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...