893 search results - page 2 / 179 » Descent Theory for Schemes |
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Often adaptive, distributed control can be viewed as an iterated game between independent players. The coupling between the players' mixed strategies, arising as the system ev...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
LOGCOM
2007
13 years 5 months ago
2007
Harvey Friedman introduced natural independence results for the Peano axioms via certain schemes of combinatorial well-foundedness. We consider here parameterized versions of this...
ANTS
2008
Springer
13 years 7 months ago
2008
Springer
The theory of 4-descent on elliptic curves has been developed in the PhD theses of Siksek [18], Womack [21] and Stamminger [20]. Prompted by our use of 4-descent in the search for ...
TNN
2008
13 years 5 months ago
2008
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...