Sciweavers

2500 search results - page 493 / 500
» Specifying Behavior in C
Sort
View
IPL
1998
95views more  IPL 1998»
14 years 9 months ago
Coloring Random Graphs
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
Michael Krivelevich, Benny Sudakov
NN
1998
Springer
108views Neural Networks» more  NN 1998»
14 years 9 months ago
How embedded memory in recurrent neural network architectures helps learning long-term temporal dependencies
Learning long-term temporal dependencies with recurrent neural networks can be a difficult problem. It has recently been shown that a class of recurrent neural networks called NA...
Tsungnan Lin, Bill G. Horne, C. Lee Giles
TOSEM
1998
80views more  TOSEM 1998»
14 years 9 months ago
Discovering Models of Software Processes from Event-Based Data
Many software process methods and tools presuppose the existence of a formal model of a process. Unfortunately, developing a formal model for an on-going, complex process can be d...
Jonathan E. Cook, Alexander L. Wolf
TROB
2002
244views more  TROB 2002»
14 years 9 months ago
Distributed surveillance and reconnaissance using multiple autonomous ATVs: CyberScout
The objective of the CyberScout project is to develop an autonomous surveillance and reconnaissance system using a network of all-terrain vehicles. In this paper, we focus on two f...
Mahesh Saptharishi, C. Spence Oliver, Christopher ...
NECO
2007
150views more  NECO 2007»
14 years 9 months ago
Reinforcement Learning, Spike-Time-Dependent Plasticity, and the BCM Rule
Learning agents, whether natural or artificial, must update their internal parameters in order to improve their behavior over time. In reinforcement learning, this plasticity is ...
Dorit Baras, Ron Meir