ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 66,203 of 1,394,228
|
|
Results 1 - 20 of 66,203
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
Mutation Analysis for Reactive System Environment Properties
|
|
November 2006
|
|
MUTATION '06: Proceedings of the Second Workshop on Mutation Analysis
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
Reactive systems used in safety-critical domains demand high level of confidence. The development of these systems, which are submitted to several normative recommendations, is complex and expensive. Reactive systems can be developed by using the data-flow ...
|
|
2
|
|
A characterization for a set of partial partitions to define an X-tree
|
|
March 2002
|
|
Discrete Mathematics
, Volume 247 Issue 1-3
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
Trees whose vertices are partially labelled by elements of a finite set X provide a natural way to represent partitions of subsets of X. The condition under which a given collection of such partial partitions of X can be represented ...
Keywords: X-trees, chordal graphs, free X-trees, partition intersection graphs
|
|
3
|
|
A Mathematical Model and Scheduling Heuristics for Satisfying Prioritized Data Requests in an Oversubscribed Communication Network
|
|
September 2000
|
|
IEEE Transactions on Parallel and Distributed Systems
, Volume 11 Issue 9
|
|
Publisher: IEEE Press
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 7 |
|
|
Abstract¿Providing up-to-date input to users' applications is an important data management problem for a distributed computing environment, where each data storage location and intermediate node may have specific data available, storage limitations, ...
Keywords: Communication network, data management, Dijkstra's multiple-source shortest-path algorithm, distributed processing, heterogeneous computing, scheduling heuristics.
|
|
4
|
|
5
|
|
Bipartite Subgraphs and Quasi-Randomness
|
|
June 2004
|
|
Graphs and Combinatorics
, Volume 20 Issue 2
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
We say that a family of graphs * is p-quasi-random, 0<p<1, if it shares typical properties of the random graph G(n,p); for a definition, see below. We denote by * the class of all graphs H for which * and ...
|
|
6
|
|
Recursive monadic bindings
|
|
September 2000
|
|
ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(689.66 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 3, Downloads (12 Months): 40, Downloads (Overall): 197, Citation Count: 9 |
|
|
Monads have become a popular tool for dealing with computational effects in Haskell for two significant reasons: equational reasoning is retained even in the presence of effects; and program modularity is enhanced by hiding "plumbing" issues inside the ...
|
Also published in: |
| September 2000 |
SIGPLAN Notices |
Volume 35 Issue 9 |
|
|
7
|
|
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 |
|
|
|
|
|
8
|
|
Link fusion: a unified link analysis framework for multi-type interrelated data objects
|
|
May 2004
|
|
WWW '04: Proceedings of the 13th international conference on World Wide Web
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(510.05 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 9, Downloads (12 Months): 98, Downloads (Overall): 937, Citation Count: 14 |
|
|
Web link analysis has proven to be a significant enhancement for quality based web search. Most existing links can be classified into two categories: intra-type links (e.g., web hyperlinks), which represent the relationship of data objects within a homogeneous ...
Keywords: data fusion, information retrieval, link analysis algorithms, link fusion
|
|
9
|
|
10
|
|
Comparing queues and stacks as mechanisms for laying out graphs
|
|
August 1992
|
|
SIAM Journal on Discrete Mathematics
, Volume 5 Issue 3
|
|
Publisher: Society for Industrial and Applied Mathematics
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 7 |
|
|
|
Keywords: book embedding, graph embedding, queue layout, stack layout, ternary hypercube
|
|
11
|
|
12
|
|
Implicit, high-resolution, compact schemes for gas dynamics and aeroacoustics
|
|
December 1999
|
|
Journal of Computational Physics
, Volume 156 Issue 2
|
|
Publisher: Academic Press Professional, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 7 |
|
|
|
Keywords: compact schemes, high-order methods, hyperbolic equations, implicit
|
|
13
|
|
Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
|
|
May 2006
|
|
Neural Computation
, Volume 18 Issue 5
|
|
Publisher: MIT Press
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
Evolutionary game-theoretic models and, in particular, the so-called replicator equations have recently proven to be remarkably effective at approximately solving the maximum clique and related problems. The approach is centered around a classic result ...
|
|
14
|
|
15
|
|
On score sets for tournaments
|
|
January 1986
|
|
Discrete Mathematics
, Volume 58 Issue 1
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
16
|
|
A geometric interpretation of an equality by Sylvester
|
|
September 1997
|
|
Proceedings of the international conference on Combinatorics '94
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
Also published in: |
| September 1997 |
Discrete Mathematics |
Volume 174 Issue 1-3 |
|
|
17
|
|
Test Data Decompression for Multiple Scan Designs with Boundary Scan
|
|
November 1998
|
|
IEEE Transactions on Computers
, Volume 47 Issue 11
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 13 |
|
|
Abstract¿The paper presents an efficient scheme to compress and decompress in parallel deterministic test patterns for circuits with multiple scan chains. It employs a boundary-scan-based environment for high quality testing with flexible trade-offs ...
Keywords: Boundary scan, built-in self-test, design for testability, reseeding of LFSRs, multiple scan chains, scan-based designs, test data decompression.
|
|
18
|
|
19
|
|
20
|
|
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 ...
|
|
|
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