ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 13,684 of 1,394,228
|
|
Results 1 - 20 of 13,684
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
On global asymptotic stability of recurrent neural networks with time-varying delays
|
|
September 2003
|
|
Applied Mathematics and Computation
, Volume 142 Issue 1
|
|
Publisher: Elsevier Science Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 5 |
 |
|
In this paper, by constructing a new Lyapunov functional, and using M-matrix and topological degree tool, problem of the global asymptotic stability (GAS) is discussed for a class of recurrent neural networks with time-varying delays. Some simple ...
Keywords: Lyapunov functional, global asymptotic stability, nonsingular M-matrix, recurrent neural networks, time-varying delays, topological degree
|
|
2
|
|
Application of artificial neural networks to optimum bit selection
|
|
March 2002
|
|
Computers & Geosciences
, Volume 28 Issue 2
|
|
Publisher: Pergamon Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Optimum bit selection is one of the important issues in drilling engineering. Usually, optimum bit selection is determined by the lowest cost per foot and is a function of bit cost and performance as well as penetration rate. Conventional optimum rock ...
Keywords: fractals, neural networks, optimization, petroleum engineering, rock bit
|
|
3
|
|
Undecidability results for low complexity time classes
|
|
April 2000
|
|
Journal of Computer and System Sciences
, Volume 60 Issue 2
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
|
|
|
4
|
|
Group structured linear cellular automata over Zm
|
|
August 1994
|
|
Journal of Computer and System Sciences
, Volume 49 Issue 1
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
|
|
|
5
|
|
Equivalence in template-guided recombination
|
|
September 2008
|
|
Natural Computing: an international journal
, Volume 7 Issue 3
|
|
Publisher: Kluwer Academic Publishers
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Template-guided recombination (TGR) is a formal model for the DNA rearrangement which occurs in certain ciliates. In this paper, the equivalence problem for TGR is considered: given two sets of templates, is their action is the same for all operands? ...
Keywords: Ciliates, DNA recombination, Equivalence, Template-guided recombination
|
|
6
|
|
Regular symbolic analysis of dynamic networks of pushdown systems
|
|
August 2005
|
|
CONCUR 2005 - Concurrency Theory
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 3 |
|
|
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models. More precisely, we consider the problem of computing effective representations ...
|
|
7
|
|
Formalising TCP's Data Transfer Service Language: A Symbolic Automaton and its Properties
|
|
March 2008
|
|
Fundamenta Informaticae
, Volume 80 Issue 1-3
|
|
Publisher: IOS Press
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
The TCP/IP protocol suite defines the procedures governing the movement of data within the Internet. A major component of the suite is the Transmission Control Protocol (TCP), which ensures data flows reliably between Internet applications. We use Coloured ...
Keywords: Coloured Petri Nets, Data Transfer Service, Parametric Systems, Service Language, Symbolic Automata, TCP
|
|
8
|
|
Forecasting Unstable Policy Enforcement
|
|
October 2006
|
|
ICSNC '06: Proceedings of the International Conference on Systems and Networks Communication
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Policy-based network management (PBNM) is a promising but not yet delivering discipline aimed at automating network management decisions based on expert knowledge and strategic business objectives. One of the issues scarcely addressed in PBNM is the ...
|
|
9
|
|
10
|
|
Autonomous virtual mobile nodes
|
|
September 2005
|
|
DIALM-POMC '05: Proceedings of the 2005 joint workshop on Foundations of mobile computing
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(178.37 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 4, Downloads (12 Months): 39, Downloads (Overall): 307, Citation Count: 2 |
|
|
This paper presents a new abstraction for virtual infrastructure in mobile ad hoc networks. An Autonomous Virtual Mobile Node (AVMN) is a robust and reliable entity that is designed to cope with the inherent difficulties caused by processors arriving, ...
Keywords: ad hoc networks, distributed algorithms, fault-tolerance, location-aware, mobile networks, virtual infrastructure
|
|
11
|
|
Abstract computability and algebraic specification
|
|
April 2002
|
|
Transactions on Computational Logic (TOCL)
, Volume 3 Issue 2
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(494.44 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 17, Downloads (12 Months): 97, Downloads (Overall): 1942, Citation Count: 2 |
|
|
Abstract computable functions are defined by abstract finite
deterministic algorithms on many-sorted algebras. We show that
there exist finite universal algebraic specifications that specify
uniquely (up to isomorphism) (i) all abstract computable ...
Keywords: Abstract computability, algebraic specification, computable analysis, conditional equations, equational logic, metric algebras, topological algebras
|
|
12
|
|
13
|
|
On the time complexity of 2-tag systems and small universal Turing machines
|
|
October 2006
|
|
FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 4 |
|
|
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing machines in polynomial time. This is an exponential improvement on the previously ...
|
|
14
|
|
Neural Coding in the Dorsal Visual Stream
|
|
July 2008
|
|
SAB '08: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
The information flow along the dorsal visual stream of the primate brain is being thoroughly studied in neuroscience, and this research is being used in artificial intelligence applications. The knowledge regarding one of its most critical stages though, ...
|
|
15
|
|
Automata and fixed point logic: a coalgebraic perspective
|
|
April 2006
|
|
Information and Computation
, Volume 204 Issue 4
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 6 |
|
|
This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F: Set to Set be a standard functor that preserves weak pullbacks. We introduce various notions of F-automata, devices that operate on pointed ...
Keywords: automata, bisimulation, coalgebra, fixed point operators, game semantics, modal logic, parity games
|
|
16
|
|
17
|
|
Supervised adaptive resonance networks
|
|
May 1991
|
|
ANNA '91: Proceedings of the conference on Analysis of neural network applications
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(1.44 MB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 13, Downloads (12 Months): 29, Downloads (Overall): 519, Citation Count: 0 |
|
|
|
|
|
18
|
|
19
|
|
20
|
|
Modal μ-calculus and alternating tree automata
|
|
January 2002
|
|
Automata logics, and infinite games
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site