ADVANCED SEARCH
Advanced Search
FEEDBACK
Please provide us with feedback
Found 49,440 of 1,394,228
|
|
Results 1 - 20 of 49,440
|
|
|
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
|
|
A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time
|
|
July 1998
|
|
Theoretical Computer Science
, Volume 202 Issue 1-2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 31 |
 |
|
|
Keywords: Markov chain, bisimulation equivalence, priority, probability, process algebra
|
|
3
|
|
Defining and detecting feature interactions
|
|
January 1997
|
|
Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
|
|
Publisher: Chapman & Hall, Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
 |
|
|
Keywords: feature interactions, logic programming, relational specifications
|
|
4
|
|
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 |
 |
|
|
|
|
5
|
|
The semantics of types in programming languages
|
|
January 1995
|
|
Handbook of logic in computer science (vol. 3)
|
|
Publisher: Oxford University Press
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
 |
|
|
|
|
6
|
|
A path-relinking approach for a bi-criteria disassembly sequencing problem
|
|
December 2008
|
|
Computers and Operations Research
, Volume 35 Issue 12
|
|
Publisher: Elsevier Science Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
The first crucial step of product recovery is disassembly. Some product disassembly is almost always needed in remanufacturing, recycling, and disposal. Since disassembly tends to be expensive, disassembly sequence planning becomes important in minimizing ...
Keywords: Disassembly sequence problem, GRASP, Multicriteria, Path relinking, Reverse logistics
|
|
7
|
|
A computer microworld to introduce students to probability
|
|
July 1994
|
|
Journal of Computers in Mathematics and Science Teaching
, Volume 13 Issue 2
|
|
Publisher: Association for the Advancement of Computing in Education
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
|
|
|
8
|
|
Data structures for on-line updating of matroid intersection solutions
|
|
December 1984
|
|
STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(692.56 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 1, Downloads (12 Months): 7, Downloads (Overall): 120, Citation Count: 0 |
 |
|
Matroid intersection problems are considered in which one of the matroids is a partition matroid specifying that exactly q elements in the solution must be red, and the rest green. A characterization is presented for how the solution ...
|
|
9
|
|
10
|
|
11
|
|
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 |
 |
|
|
|
|
12
|
|
Fuzzy structures on hyper K-algebras
|
|
February 2002
|
|
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
, Volume 10 Issue 1
|
|
Publisher: World Scientific Publishing Co., Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
In this note first we define the notions of fuzzy hyperK-subalgebra and fuzzy (weak) hyperK-ideal of a hyperK-algebra. Then we state and prove some equivalent conditions for these notions. In particular we conclude that any fuzzy ...
Keywords: fuzzy (weak) hyperK-ideal, fuzzy hyperK-subalgebra, hyperK-algebra
|
|
13
|
|
Scheduling Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model
|
|
January 2001
|
|
IEEE Transactions on Computers
, Volume 50 Issue 1
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
 |
|
Abstract¿Real-time distributed applications have timing constraints on tasks running on several processors. To design real-time systems with end-to-end performance requirements, we need to have algorithms to schedule and to coordinate tasks on different ...
Keywords: Distributed system, real-time system, pinwheel scheduling, end-to-end delay.
|
|
14
|
|
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
|
|
15
|
|
Distribution-independent hierarchical N-body methods
|
|
November 1995
|
|
Distribution-independent hierarchical N-body methods
|
|
Publisher: Iowa State University
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
 |
|
|
Keywords: Greengard method
|
|
16
|
|
A Bayesian weighting principle for the fundamental matrix estimation
|
|
November 2000
|
|
Pattern Recognition Letters
, Volume 21 Issue 12
|
|
Publisher: Elsevier Science Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
 |
|
|
Keywords: correspondence problem, epipolar geometry, fundamental matrix, outlier rejection, stereo vision
|
|
17
|
|
Strong bias of group generators: an obstacle to the "product replacement algorithm"
|
|
February 2004
|
|
Journal of Algorithms
, Volume 50 Issue 2
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
Let G be a finite group. Efficient generation of nearly uniformly distributed random elements in G, starting from a given set of generators of G, is a central problem in computational group theory. In this paper we demonstrate ...
|
|
18
|
|
19
|
|
On Blind Timing Acquisition and Channel Estimation for Wideband Multiuser DS-CDMA Systems
|
|
February 2002
|
|
Journal of VLSI Signal Processing Systems
, Volume 30 Issue 1/3
|
|
Publisher: Kluwer Academic Publishers
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
The problems of blind timing acquisition and channel estimation for DS-CDMA signals in multipath fading channels are investigated. Using only the spreading code of the desired user, methods based on QR decompositions are proposed. These methods ...
Keywords: DS-CDMA, QR decompositions, blind algorithms, channel estimation, multipath fading, multiuser systems, synchronization, timing acquisition, wideband CDMA
|
|
20
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|