1972 search results - page 103 / 395 » connection 2008 |
70
Voted
DAM
1999
15 years 13 days ago
1999
Compound methods have been shown to be very e ective in the construction of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a b...
98
Voted
AGI
2008
15 years 2 months ago
2008
: Consistent with the ultimate goals of AGI, we can expect that deductive consequences of large and grammatically varied text bases would not be generated by sequential application...
115
Voted
DM
2007
15 years 22 days ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
71
Voted
DM
1999
15 years 13 days ago
1999
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive descr...
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— We study the problem of reaching a consensus in the values of a distributed system of agents with time-varying connectivity in the presence of delays. We consider a widely stud...