Sciweavers

284 search results - page 37 / 57
» On the adaptable chromatic number of graphs
Sort
View
WWW
2005
ACM
14 years 8 months ago
Adaptive page ranking with neural networks
Recent developments in the area of neural networks provided new models which are capable of processing general types of graph structures. Neural networks are well-known for their ...
Franco Scarselli, Sweah Liang Yong, Markus Hagenbu...
ATAL
2010
Springer
13 years 8 months ago
Using graph analysis to study networks of adaptive agent
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
Sherief Abdallah
ECRTS
2008
IEEE
14 years 1 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 7 months ago
Exact counting of Euler Tours for generalized series-parallel graphs
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
Prasad Chebolu, Mary Cryan, Russell A. Martin
ISAAC
2001
Springer
118views Algorithms» more  ISAAC 2001»
13 years 12 months ago
On Adaptive Fault Diagnosis for Multiprocessor Systems
Abstract. We first consider adaptive serial diagnosis for multiprocessor systems. We present an adaptive diagnosis algorithm using N + t − 1 tests, which is the smallest possibl...
Kumiko Nomura, Toshinori Yamada, Shuichi Ueno