2168 search results - page 87 / 434 » Randomized Algorithms and Complexity Theory |
116
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
123
click to vote
ISNN
2005
Springer
15 years 8 months ago
2005
Springer
Built on the theories of biological neural network, artificial neural network methods have shown many significant advantages. However, the memory space in an artificial neural chip...
113
click to vote
NETGAMES
2006
ACM
15 years 9 months ago
2006
ACM
— A practical pricing mechanism is the foundation for the deploying of IP multicast in the inter-domain Internet. The IP multicast service model and its pricing mechanism are dis...
120
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency select...
123
click to vote
AAAI
2008
15 years 5 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...