|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 22091 occurrences of 8614 keywords
|
|
|
Results
Found 30405 publication records. Showing 30405 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
13 | Marcel Erné |
Intervals in Lattices of alpha-Meet-Closed Subsets. |
Order |
2004 |
DBLP DOI BibTeX RDF |
(weakly) atomic, (strongly) coatomic, extremally detachable, meet-closed, interval, prime, semilattice, complete lattice, irreducible |
13 | Xueyan Tang, Samuel T. Chanson |
The Minimal Cost Distribution Tree Problem for Recursive Expiration-Based Consistency Management. |
IEEE Trans. Parallel Distributed Syst. |
2004 |
DBLP DOI BibTeX RDF |
Expiration-based consistency management, optimization, performance analysis, caching, graph theory, replication, NP-complete |
13 | Jochen Alber, Michael R. Fellows, Rolf Niedermeier |
Polynomial-time data reduction for dominating set. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
plannar graphs, problem kernel, NP-complete problems, dominating set, data reduction, fixed-parameter tractability |
13 | Appu Muthusamy |
On Resolvable Multipartite G-Designs. |
Graphs Comb. |
2004 |
DBLP DOI BibTeX RDF |
Cycle-factorization, Wreath product of graphs, Complete symmetric k-partite multi-digraph, Resesolvable multipartite G-design |
13 | Nick Bezhanishvili, Ian M. Hodkinson |
All Normal Extensions of S5-squared Are Finitely Axiomatizable. |
Stud Logica |
2004 |
DBLP DOI BibTeX RDF |
finite axiomatization, better-quasi-ordering, NP-complete, modal logic |
13 | Radu Prodan, Thomas Fahringer |
ZENTURIO: A Grid Service-Based Tool for Optimising Parallel and Grid Applications. |
J. Grid Comput. |
2004 |
DBLP DOI BibTeX RDF |
NP-complete optimisations, semi-automatic performance benchmarking, throughput scheduling, genetic algorithms, OGSA, Grid applications, OGSI, Grid/Web services |
13 | Nizar Marcus |
E-Compactness in Pointfree Topology. |
Appl. Categorical Struct. |
2003 |
DBLP DOI BibTeX RDF |
nearness frames, relatively spatial reflections, E-complete frames, E-compact frames, Cauchy completeness, frames |
13 | Jens Gramm, Rolf Niedermeier, Peter Rossmanith |
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Consensus word analysis, NP-complete, Exact algorithms, Fixed-parameter tractability |
13 | Mariko Hagita, André Kündgen, Douglas B. West |
Probabilistic Methods for Decomposition Dimension of Graphs. |
Graphs Comb. |
2003 |
DBLP DOI BibTeX RDF |
Union-free family, Hypercube, Random graph, Probabilistic method, Cartesian product, Complete graph |
13 | Eugene Shragowitz, Habib Youssef, Bing Lu |
Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models. |
J. Comb. Optim. |
2003 |
DBLP DOI BibTeX RDF |
duration of activities, scheduling, approximation algorithms, directed acyclic graphs, NP-complete problems, critical path, timing bounds, PERT, slack |
13 | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
On the Existence and Determination of Satisfactory Partitions in a Graph. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
Satisfactory partition, degree constraints, complexity, graph, NP-complete, polynomial algorithm |
13 | Layuan Li, Chunlin Li 0001 |
A QoS Multicast Routing Protocol for Dynamic Group Topology. |
Euro-Par |
2003 |
DBLP DOI BibTeX RDF |
multiple QoS constraints, protocol, NP-complete, QoS routing, Multicast routing |
13 | Michelle Moore |
An Accurate and Efficient Parallel Genetic Algorithm to Schedule Tasks on a Cluster. |
IPDPS |
2003 |
DBLP DOI BibTeX RDF |
genetic algorithms, NP-complete, scheduling algorithms, parallel genetic algorithms, parallel scheduling |
13 | Edwin D. de Jong, Jordan B. Pollack |
Learning the Ideal Evaluation Function. |
GECCO |
2003 |
DBLP DOI BibTeX RDF |
Complete Evaluation Set, ideal evaluation, underlying objectives, Pareto-hillclimber, over-specialization, Coevolution, Pareto-Coevolution |
13 | Lee J. White, Husain Almezen, Shivakumar Sastry |
Firewall Regression Testing of GUI Sequences and their Interactions. |
ICSM |
2003 |
DBLP DOI BibTeX RDF |
Complete Interaction GUI Sequences, Graphical User Interfaces, Regression Testing, GUI Testing |
13 | Iyad A. Kanj, Ljubomir Perkovic |
Improved Parameterized Algorithms for Planar Dominating Set. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
planar dominating set, NP-complete problems, parameterized algorithms |
13 | Alexander E. Mohr |
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem. |
DCC |
2002 |
DBLP DOI BibTeX RDF |
multiple choice knapsack problem, MCKP, data compression, NP-complete, NP-hard, quantization, knapsack problem, bit allocation, rate-distortion optimization |
13 | Ian Agol, Joel Hass, William P. Thurston |
3-manifold knot genus is NP-complet. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
3-manifold, normal surface, computational complexity, NP-complete, knot, genus |
13 | S. L. Lee, H.-J. Ho |
Algorithms and Complexity for Weighted Hypergraph Embedding in a Cycle. |
CW |
2002 |
DBLP DOI BibTeX RDF |
Approximation Algorithm, Parallel Computing, NP-Complete, LP-Relaxation |
13 | Vincenzo Cutello, Giuseppe Nicosia |
An Immunological Approach to Combinatorial Optimization Problems. |
IBERAMIA |
2002 |
DBLP DOI BibTeX RDF |
Evolutionary Computation, Combinatorial Optimization, NP-complete problems, Immune Algorithms |
13 | Mojgan Mahmoudi, M. Mehdi Ebrahimi |
Purity and Equational Compactness of Projection Algebras. |
Appl. Categorical Struct. |
2001 |
DBLP DOI BibTeX RDF |
projection algebra, pure, equationally compact, s-pure, s-compact, s-injective, pure-essential, equational compact hull, injective hull, complete, sequence |
13 | Young-Joo Suh, Kang G. Shin |
All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks. |
IEEE Trans. Parallel Distributed Syst. |
2001 |
DBLP DOI BibTeX RDF |
direct exchange, message-combining, Collective communication, interprocessor communication, complete exchange, all-to-all personalized communication |
13 | Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir |
Axiomatizing Tropical Semirings. |
FoSSaCS |
2001 |
DBLP DOI BibTeX RDF |
relative axiomatizations, commutative idempotent weak semirings, tropical semirings, exponential time complexity, convexity, varieties, Equational logic, complete axiomatizations |
13 | Janis Cirulis |
Are There Essentially Incomplete Knowledge Representation Systems? |
FCT |
2001 |
DBLP DOI BibTeX RDF |
complete information, fuzzification, knowledge representation system, simulation, uncertainty |
13 | Arun K. Somani, Allen M. Sansano |
Achieving Robustness and Minimizing Overhead in Parallel Algorithms Through Overlapped Communication/Computation. |
J. Supercomput. |
2000 |
DBLP DOI BibTeX RDF |
Proteus Parallel Computer System, overlapping computing and communication, partitioning and scheduling for high-performance, fault tolerance, communication overhead, complete exchange |
13 | Ching-Hsien Hsu, Yeh-Ching Chung, Chyi-Ren Dow |
Efficient Methods for Multi-Dimensional Array Redistribution. |
J. Supercomput. |
2000 |
DBLP DOI BibTeX RDF |
the basic-block calculation technique, the complete-dimension calculation technique, distributed memory multicomputers, array redistribution |
13 | Helmut Röhrl |
Completeness and Cocompleteness of RSmod1 N. |
Appl. Categorical Struct. |
2000 |
DBLP DOI BibTeX RDF |
prenormed semimodule, N-summation, cocomplete, free objects, complete |
13 | Satoshi Ohtake, Toshimitsu Masuzawa, Hideo Fujiwara |
A Non-Scan Approach to DFT for Controllers Achieving 100% Fault Efficiency. |
J. Electron. Test. |
2000 |
DBLP DOI BibTeX RDF |
non-scan design for testability, complete fault efficiency, controllers, at-speed test |
13 | Jean-Philippe Tarel, David B. Cooper |
The Complex Representation of Algebraic Curves and Its Simple Exploitation for Pose Estimation and Invariant Recognition. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2000 |
DBLP DOI BibTeX RDF |
Complex polynomials, pose-independent curve recognition, Euclidean invariants, complete-sets of rotation invariants, curve centers, implicit polynomial curves, pose estimation, shape representation, shape recognition, algebraic curves |
13 | Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura |
Real-time task scheduling algorithms for maximum utilization of secondary batteries in portable devices. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
secondary cells, power generation scheduling, power engineering computing, real time task scheduling algorithms, maximum utilization, secondary batteries, low power energy techniques, dynamic real time scheduling algorithms, secondary battery consumption, CPU frequency, real time scheduling algorithm, discrete frequency control, arbitrary frequency, real-time systems, computational complexity, computational complexity, NP-complete, portable devices, decision problem, portable computers, scheduling problem, task switching, real time tasks, amortized analysis, optimal scheduling algorithm, frequency control, frequency control |
13 | Byung-Kyu Choi, Riccardo Bettati |
Efficient resource management for hard real-time communication over differentiated services architectures. |
RTCSA |
2000 |
DBLP DOI BibTeX RDF |
hard real-time communication, differentiated services architectures, sink trees, admission probability, link resource utilization, resource allocation, resource management, heuristic algorithm, NP-complete problem, resource reservation, computer network management, telecommunication services, simulation experiments |
13 | Kai Song Goh, Andrew Lim 0001 |
Combining various algorithms to solve the ship berthing problem. |
ICTAI |
2000 |
DBLP DOI BibTeX RDF |
ship berthing problem, acyclic list, randomized local search, genetic algorithm, performance, computational complexity, Tabu search, directed graphs, directed acyclic graph, search problems, NP-complete problems |
13 | Sergio De Agostino |
Speeding up Parallel Decoding of LZ Compressed Text on the PRAM EREW. |
SPIRE |
2000 |
DBLP DOI BibTeX RDF |
LZ compressed text, PRAM EREW, sliding window compression, LZ2 compression method, LZ1 compression, output string, next character heuristic, identity heuristic, data compression, dictionary, text compression, P-complete, parallel decoding |
13 | Juan Castellanos, Gheorghe Paun, Alfonso Rodríguez-Patón |
Computing with Membranes: P Systems with Worm-Objects. |
SPIRE |
2000 |
DBLP DOI BibTeX RDF |
worm-objects, string multisets, output membrane, recursively enumerable sets, quadratic time, membrane division, computational complexity, directed graph, NP-complete problem, symbols, P systems, linear time, SAT problem, Hamiltonian Path Problem, polynomial solution |
13 | William G. Howerton, Michael G. Hinchey |
Using the Right Tool for the Job. |
ICECCS |
2000 |
DBLP DOI BibTeX RDF |
integration phases, development technique, informal specification techniques, abstract highly structured models, rigorous analysis, Air Force Weather Agency Standard Degribber, meteorological system, data decoding/encoding, World Meteorological Organization, standard Gridded Binary format, state based issues, complete specification, tool box approach, UML, formal specification, formal methods, semantics, software specification, specification technique, formal notation, modular approach, component specification, complex systems development |
13 | Maria E. Markaki, Marios P. Saltouros, Iakovos S. Venieris |
Proportional Packet Loss Differentiation and Buffer Management for Differentiated Services in the Internet. |
LCN |
2000 |
DBLP DOI BibTeX RDF |
proportional packet loss differentiation, buffer management algorithm, differentiated services architecture, class-based queuing, QoS traffic classes, OPNET Modeler 6.0.L, complete partitioning, push-out, push-out with threshold, quality of service, quality of service, Internet, Internet, queueing theory, packet switching, scheduling algorithm, digital simulation, differentiated services, buffer storage, telecommunication network routing, telecommunication traffic, packet loss, IP routers, simulation platform |
13 | Xiang-Yang Li 0001, Liwu Liu, Peng-Jun Wan, Ophir Frieder |
Practical Traffic Grooming Scheme for Single-Hub SONET/WDM Rings. |
LCN |
2000 |
DBLP DOI BibTeX RDF |
multiplexing equipment, demultiplexing equipment, practical traffic grooming, single-hub SONET/WDM rings, SONET/WDM networks, low rate tributary streams, SONET add/drop multiplexer, electronic multiplexing, electronic demultiplexing, tributary traffic patterns, minimal resource cost, BLSR/2, UPSR, optimal grooming, line speeds, computational complexity, approximation algorithms, network topology, NP-complete problem, wavelength division multiplexing, telecommunication traffic, approximation theory, ADM, SONET, optical fibre networks, nonuniform traffic |
13 | Géraud Sénizergues |
T(A) = T(B)? |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
deterministic pushdown transducers, finite dimensional vector spaces, matrix semi-groups, complete formal systems, test-sets, rational series |
13 | Marcos Cordeiro d'Ornellas, Rein van den Boomgaard |
Developing Morphological Building Blocks: From Design to Implementation. |
SIBGRAPI |
1999 |
DBLP DOI BibTeX RDF |
image algebra, morphological algorithms, mathematical morphology, complete lattices |
13 | Tim Kovacs |
Strength or Accuracy? Fitness Calculation in Learning Classifier Systems. |
Learning Classifier Systems |
1999 |
DBLP DOI BibTeX RDF |
strong overgeneral classifiers, biased reward functions, accuracy-based fitness, complete covering maps, exploration, XCS |
13 | Tomoko Ninomiya, Masao Mukaidono |
Clarifying the Axioms of Kleene Algebra based on the Method of Indeterminate Coefficients. |
ISMVL |
1999 |
DBLP DOI BibTeX RDF |
the Method of Indeteminate Coefficients, Independency of axiom, Complete axioms, Kleene Algebra |
13 | Géraud Sénizergues |
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
equational graphs, deterministic pushdown automata, rational languages, matrix semi-groups, complete formal systems, decidability, bisimulation |
13 | Nimrod Bayer, Yaakov Kogan |
Branching/queueing networks: Their introduction and near-decomposability asymptotics. |
Queueing Syst. Theory Appl. |
1997 |
DBLP DOI BibTeX RDF |
nearly complete decomposability, closed queueing networks, branching processes |
13 | Mayez A. Al-Mouhamed, Steven S. Seiden |
A Heuristic Storage for Minimizing Access Time of Arbitrary Data Patterns. |
IEEE Trans. Parallel Distributed Syst. |
1997 |
DBLP DOI BibTeX RDF |
Boolean matrices, performance evaluation, heuristics, NP-complete, memory organization, storage schemes, parallel memories |
13 | Witold Charatonik, Andreas Podelski |
Set Constraints with Intersection. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
satisfiability test, set-based program analysis, DEXPTIME-complete, complexity characterization, negative set constraints, negated conjuncts, negated inclusion, computability, decidability, intersection, inclusions, set constraints |
13 | Pascal Koiran |
Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
Arthur-Merlin class, Generalized Riemann Hypothesis, complexity, NP-complete, randomized algorithms, deterministic algorithms, deterministic algorithms, algebraic varieties |
13 | Joseph Naor, Leonid Zosin |
A 2-Approximation Algorithm for the Directed Multiway Cut Problem. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
directed multiway cut problem, 2-approximation algorithm, multiway flow function, NP-complete, directed graphs, polynomial-time algorithm, approximation factor |
13 | Géraud Sénizergues |
The Equivalence Problem for Deterministic Pushdown Automata is Decidable. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
deterministic pushdown automata, finite dimensional vector spaces, matrix semigroups, complete formal systems, rational series |
13 | Andrew E. Johnson 0002, Sing Bing Kang |
Registration and Integration of Textured 3-D Data. |
3DIM |
1997 |
DBLP DOI BibTeX RDF |
textured 3-D data registration, textured 3-D data integration, complete 3-D model, multi-roomed indoor scene, 3-D textured model, 3-D occupancy grid, spatial occupancy, image registration, voting, occupancy grid, iterative closest point algorithm |
13 | Xuedong Jiang, Tao Yang |
Heuristic algorithms for path selection in private ATM networks. |
ICCCN |
1997 |
DBLP DOI BibTeX RDF |
private ATM networks, minimum hop path, end-to-end delay requirement, maximum load level, unconstrained shortest path problem, randomly generated networks, call blocking ratio, link metric, performance, asynchronous transfer mode, probability, call admission control, heuristic algorithms, network routing, NP-complete problem, simulation study, shortest path problem, path selection, multiple constraints |
13 | Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori |
QoS routing algorithms for pre-computed paths. |
ICCCN |
1997 |
DBLP DOI BibTeX RDF |
pre-computed paths, QoS routing algorithms, multiple QoS constraints, QoSR/sub BF/ on-demand algorithm, flow specification parameters, routing table size reduction, bandwidth, NP-complete problem, telecommunication network routing |
13 | Peter J. Stuckey, Vincent W. L. Tam |
Extending EGENET with Lazy Constraint Consistency. |
ICTAI |
1997 |
DBLP DOI BibTeX RDF |
extended EGENET, lazy constraint consistency, neural network simulator, min-conflict heuristic, hard graph-colouring problems, complete search methods, stochastic search methods, convergence behaviour, scheduling, planning (artificial intelligence), planning, constraint satisfaction problems, bin-packing, arc consistency, search behaviour |
13 | Dilip Krishnaswamy, Michael S. Hsiao, Vikram Saxena, Elizabeth M. Rudnick, Janak H. Patel, Prithviraj Banerjee |
Parallel Genetic Algorithms for Simulation-Based Sequential Circuit Test Generation. |
VLSI Design |
1997 |
DBLP DOI BibTeX RDF |
simulation-based test generation, distributed memory MIMD machines, shared memory MIMD machines, parallel search strategies, logic testing, fault coverage, NP-complete problems, VLSI circuits, parallel genetic algorithms, sequential circuit test generation |
13 | Sung Kwon Kim |
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees. |
ISPAN |
1997 |
DBLP DOI BibTeX RDF |
planar mincut, parallel algorithm, NP-complete, trees (mathematics), EREW PRAM, polynomial-time solvable |
13 | Javier Orozco, Ricardo Cayssials, Jorge Santos 0002, Edgardo Ferro |
Precedence constraints in hard real-time distributed systems. |
ICECCS |
1997 |
DBLP DOI BibTeX RDF |
hard real-time distributed systems, multitask-multiprocessor systems, taxonomic genus, tentative assignment, formally proved method, tentative assignments, real-time systems, NP-complete problem, precedence constraints |
13 | Sanjoy K. Baruah, Steve Goddard, Kevin Jeffay |
Feasibility concerns in PGM graphs with bounded buffers. |
ICECCS |
1997 |
DBLP DOI BibTeX RDF |
feasibility concerns, processing graph method, embedded signal processing, co-NP-complete, optimal preemptive scheduling algorithm, system architects, real-time scheduling, data flow graphs, memory requirements, computational resources, feasibility test, dataflow model, bounded buffers |
13 | Pi-Rong Sheu, Charng-Maw Lin |
A fast optimal slot reuse scheme for CRMA high speed networks. |
LCN |
1997 |
DBLP DOI BibTeX RDF |
CRMA high speed networks, cyclic-reservation multiple-access, fast optimal slot reuse scheme, high-speed local area networks, high-speed metropolitan area networks, folded-bus configurations, dual-bus configurations, reserve command generation, empty slots reservation, average cycle length, average throughput, average MAC delay, performance measurements, time complexity, computer simulations, NP-complete problem, metropolitan area networks, access delay |
13 | Ion Muslea |
The Very Offline k-Vehicle Routing Problem in Trees. |
SCCC |
1997 |
DBLP DOI BibTeX RDF |
very offline k-vehicle routing problem, general vehicle routing problem, NP-complete variants, fast approximation algorithms, 2-vehicle routing problems, computational complexity, trees |
13 | Pascal Véron |
Improved identification schemes based on error-correcting codes. |
Appl. Algebra Eng. Commun. Comput. |
1996 |
DBLP DOI BibTeX RDF |
SD problem, Zeroknowledge, NP-complete problem, Identification scheme |
13 | Moreno Coli, Paolo Palazzari |
Load Balancing with Internode Precedence Relations: A New Method for Static Allocation of DAGs into Parallel Systems. |
PDP |
1996 |
DBLP DOI BibTeX RDF |
internode precedence relations, static allocation, parallel execution times, performance, parallel algorithms, load balancing, parallel programming, parallel program, resource allocation, NP-complete, parallel machine, directed graphs, DAG, directed acyclic graphs, processor scheduling, software performance evaluation, parallel systems, execution time, processor allocation, mapping algorithms, computational load |
13 | Xiaohua Jia, Jiannong Cao 0001, Weijia Jia 0001 |
Real-time multicast routing with optimal network cost. |
RTCSA |
1996 |
DBLP DOI BibTeX RDF |
real-time multicast routing, optimal network cost, minimal network cost, shortest network delay, optimal overall network cost, minimum spanning tree heuristic, delay, time constraint, real-time applications, NP-complete problem, telecommunication channels |
13 | Man-Fai Yu, Joel Darnauer, Wayne Wei-Ming Dai |
Interchangeable pin routing with application to package layout. |
ICCAD |
1996 |
DBLP DOI BibTeX RDF |
BGA, all-angle wiring, interchangeable pin routing, min-cost max-flow heuristic, multiple layers, octilinear wiring, package layout, pin redistribution, prerouted nets, rectilinear wiring, test fixture routing, triangulated routing network, CAD, NP-complete, ASIC, circuit layout CAD, speed, PGA, input output, routing problems |
13 | Dan A. Simovici, Corina Reischer |
Several Remarks on the Complexity of Set-Valued Switching Functions. |
ISMVL |
1996 |
DBLP DOI BibTeX RDF |
set-valued switching functions, complexity of circuits, set-valued logic functions, complete basis, Boolean components, non-Boolean components, computational complexity, complexity, Boolean algebra, switching functions |
13 | Matthias Baaz, Christian G. Fermüller |
Intuitionistic Counterparts of Finitely-Valued Logics. |
ISMVL |
1996 |
DBLP DOI BibTeX RDF |
Kripke's model structures, finitely-valued logics, classical sequent calculus, cut-free complete, calculi, syntactical restriction, process algebra, multivalued logic, intuitionistic logic, Kripke structures |
13 | Robert H. Klenke, James H. Aylor, Joseph M. Wolf |
An analysis of fault partitioning algorithms for fault partitioned ATPG. |
VTS |
1996 |
DBLP DOI BibTeX RDF |
fault partitioning algorithm, VLSI device, detected fault broadcasting, preprocessing time, parallel processing, parallel processing, VLSI, fault diagnosis, integrated circuit testing, ATPG, automatic testing, dynamic load balancing, NP complete problem, digital system, test vector generation |
13 | Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya |
Geometric bipartitioning problem and its applications to VLSI. |
VLSI Design |
1996 |
DBLP DOI BibTeX RDF |
geometric bipartitioning problem, layout design, rectilinear modules, staircase, monotone increasing, classical graph bisection problem, weighted permutation graph, integer edge weights, designated nodes, absolute value, edge weights, routing, computational complexity, VLSI, VLSI, graph theory, NP-complete, branch-and-bound, floorplan, heuristic algorithm, search problems, geometry, network routing, circuit layout CAD, hierarchical decomposition |
13 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. |
CCC |
1996 |
DBLP DOI BibTeX RDF |
multivalued functions, NPMV functions, coNPMV, complete functions, query hierarchy, functional analogue, Boolean hierarchy, computational complexity, complexity, multivalued logic, polynomial time hierarchy |
13 | Jan-Ming Ho, De-Ron Liang, Kuo-Hui Tsai |
On multicast routing in Clos networks. |
ISPAN |
1996 |
DBLP DOI BibTeX RDF |
online multicast routing, off-line routing, quality of service, performance evaluation, NP-complete, multiprocessor interconnection networks, video conferencing, network routing, multicast routing, high speed networks, system performance, shortest path problem, Clos networks, network throughput, Steiner tree problem, optimizing criteria |
13 | Bill Triggs |
Matching Constraints and the Joint Image. |
ICCV |
1995 |
DBLP DOI BibTeX RDF |
combined homogeneous image coordinates, multi image perspective projection, image measurements, combined image projections, 3D joint image subspace, complete projective replica, 3D world, image coordinates, 4 index joint image Grassmannian tensor, multilinear tensorial equations, trilinear constraint, complex algebraic interdependency, quadratic structural simplicity constraints, computational geometry, image reconstruction, linear algebra, tensors, projective reconstruction, epipolar constraint, constraint theory, imaging geometry, matching constraints |
13 | Luc Robert, Michel Buffa, Martial Hebert |
Weakly-Calibrated Stereo Perception for Rover Navigation. |
ICCV |
1995 |
DBLP DOI BibTeX RDF |
weakly-calibrated stereo perception, stereo perception, rover navigation, weakly calibrated stereo images, relative point elevation, reference plane, vision module, complete navigation system, shape indicator, appropriate steering directions, unstructured outdoor environments, wheeled rover, navigation, mobile robots, calibration, image matching, path planning, stereo image processing, epipolar geometry, robot vision, vision system, computerised navigation, autonomous navigation, point matching, projection images, image rectification |
13 | Stephen S. Intille, Aaron F. Bobick |
Closed-World Tracking. |
ICCV |
1995 |
DBLP DOI BibTeX RDF |
closed-world tracking, weakly modeled object tracking, semantically rich domain, space-time region, complete object taxonomy, contextual object information, context-specific features, semi-automatic symbolic description generation, contextually-rich dynamic scene, football domain, closed-world football player tracking, computer vision, tracking, image sequences, image sequence, object detection, action, video annotation, sport, pixel |
13 | Moreno Coli, Paolo Palazzari |
Global execution time minimization by allocating tasks in parallel systems. |
PDP |
1995 |
DBLP DOI BibTeX RDF |
global execution time minimization, heuristic criterion, starting population, static allocation, genetic algorithms, genetic algorithm, computational complexity, resource allocation, parallel machines, parallel machine, directed graphs, directed acyclic graphs, DAGs, processor scheduling, parallel systems, task allocation, NP-complete problem, execution time, minimisation, cost function, critical path, precedence relations, critical path analysis |
13 | José Ramón González de Mendívil, Akim Demaille, José M. Bernabéu-Aubán, José Ramón Garitagoitia |
Correctness of a distributed deadlock resolution algorithm for the single request model. |
PDP |
1995 |
DBLP DOI BibTeX RDF |
distributed deadlock resolution algorithm, single request model, resolution algorithm, initial specification, complete distributed system, Input/Output Automata Model, formal specification, distributed algorithms, concurrency control, refinements, operating systems (computers), automata theory, high level specification |
13 | Chantal Ykman-Couvreur, Bill Lin 0001 |
Optimised state assignment for asynchronous circuit synthesis. |
ASYNC |
1995 |
DBLP DOI BibTeX RDF |
optimised state assignment, asynchronous circuit synthesis, complete state coding, state graph level, asynchronous benchmarks, circuit area, logic design, encoding, asynchronous circuits, computation time, state assignment |
13 | Dhruva R. Chakrabarti, Ajai Jain |
An improved hierarchical test generation technique for combinational circuits with repetitive sub-circuits. |
Asian Test Symposium |
1995 |
DBLP DOI BibTeX RDF |
hierarchical test generation technique, repetitive subcircuits, hierarchical testing algorithm, bus fault model, high-level subcircuits, high level incompatibility, test generation time, complete fault coverage, computational complexity, fault diagnosis, logic testing, high level synthesis, design for testability, design for testability, ATPG, combinational circuits, combinational circuits, logic CAD, automatic test software, signal flow graphs, state transition graph |
13 | Dhabaleswar K. Panda 0001 |
Global reduction in wormhole k-ary n-cube networks with multidestination exchange worms. |
IPPS |
1995 |
DBLP DOI BibTeX RDF |
global reduction, wormhole k-ary n-cube networks, multidestination exchange worms, multidestination message passing mechanism, pairwise exchange worms, complete global reduction, barrier synchronization operations, message passing interface standard, unicast-based message passing, communication startup time, data size, fast global reduction, message passing, synchronisation, hypercube networks, system size |
13 | Shashidhar Thakur, D. F. Wong 0001 |
Simultaneous area and delay minimum K-LUT mapping for K-exact networks. |
ICCD |
1995 |
DBLP DOI BibTeX RDF |
area/delay minimum K-LUT mapping, K-exact networks, technology mapping problem, lookup table FPGAs, area minimization problem, K-bounded networks, delay minimization problem, flow-map algorithm, field programmable gate arrays, computational complexity, complexity, NP-complete, logic design, polynomial time algorithm, programmable logic arrays, table lookup, minimisation of switching nets |
13 | Chantal Ykman-Couvreur, Bill Lin 0001 |
Efficient state assignment framework for asynchronous state graphs. |
ICCD |
1995 |
DBLP DOI BibTeX RDF |
state assignment framework, asynchronous state graphs, state graph level, complete state coding problem, circuit area, logic design, encoding, asynchronous circuits, asynchronous circuits, computation time, state assignment |
13 | Stefan Ronngren, Behrooz A. Shirazi |
Static multiprocessor scheduling of periodic real-time tasks with precedence constraints and communication costs. |
HICSS (2) |
1995 |
DBLP DOI BibTeX RDF |
static multiprocessor scheduling, periodic real-time tasks, large task sets, exclusion relation, heuristic scheduling algorithms, clustering, real-time systems, resource allocation, NP-complete, multiprocessing systems, communication complexity, mutual exclusion, processor scheduling, timing constraints, task allocation, communication costs, precedence constraints, multiprocessor architecture, precedence relations, scheduling methods |
13 | Ernst W. Mayr |
Scheduling interval orders in parallel. |
HICSS (2) |
1995 |
DBLP DOI BibTeX RDF |
interval order scheduling, interval representations, transitively oriented digraph, undirected chordal complement, identical parallel processors, minimal length schedule, scheduling distance computation subroutine, incremental version, empty slots, interval order precedence constraints, scheduling, parallel algorithms, parallel algorithm, computational complexity, concurrency control, directed graphs, partial orders, NP-complete problems, deadlines, execution time, minimisation, interval graphs, optimal schedule, release times, NC-algorithm, CREW-PRAM, task systems |
13 | Meenakshisundaram Gopi, Swami Manohar |
A VLSI architecture for the computation of NURBS patches. |
VLSI Design |
1995 |
DBLP DOI BibTeX RDF |
NURBS patches, nonuniform rational B-spline, interactive modeling session, patch generation, complete hardware solution, VLSI, computational geometry, parallel architectures, computer graphics, geometric modeling, VLSI architecture, splines (mathematics), B-spline curves |
13 | Mandyam-Komar Srinivas, James Jacob, Vishwani D. Agrawal |
Functional test generation for non-scan sequential circuits. |
VLSI Design |
1995 |
DBLP DOI BibTeX RDF |
nonscan sequential circuits, functional test vectors, growth and disappearance fault model, complete stuck fault coverage, algebraic transformations, synthesized FSMs, VLSI, fault diagnosis, logic testing, finite state machines, integrated circuit testing, sequential circuits, automatic testing, functional test generation |
13 | Michael L. Edwards, Matt Flanzer, Mark Terry, Joseph Landa |
RECAP: a requirements elicitation, capture and analysis process prototype tool for large complex systems. |
ICECCS |
1995 |
DBLP DOI BibTeX RDF |
RECAP, requirements elicitation capture and analysis process prototype tool, large complex system development, consistent requirements, correct requirements, complete requirements, requirement use, requirement capture, requirement identification, natural language parsing, knowledge-based rules, semiautomatic capture elicitation analysis, unformatted natural language text, requirement translation, concise requirements data, user defined views, domain specific rules, formal specification, software tools, knowledge based systems, systems analysis, natural languages, requirement analysis, requirements specification, automated assistance, system life-cycle |
13 | Christof Ebert |
Tracing complexity through the software process. |
ICECCS |
1995 |
DBLP DOI BibTeX RDF |
complete development process, complexity factors, real-time automation projects, real-time systems, real-time systems, computational complexity, complexity, formal specification, software metrics, software process, computer aided software engineering, development environments, research project, specification methods, CASE environment |
13 | L. Simoncini, Zsolt Miklós Kovács-Vajna |
A system for reading USA census '90 hand-written fields. |
ICDAR |
1995 |
DBLP DOI BibTeX RDF |
USA census '90 handwritten fields reading, complete reading task, scanned raster image, ASCII string, form identification, field isolation, bounding box removal, blob segmentation, broken character joining, isolated character recognition, word building, dictionary correction, confidence generation, NIST Special Database, standards, optical character recognition, handwriting recognition, government data processing |
13 | Koji Tsuda, Shuji Senda, Michihiko Minoh, Katsuo Ikeda |
Clustering OCR-ed texts for browsing document image database. |
ICDAR |
1995 |
DBLP DOI BibTeX RDF |
OCR text clustering, document image database browsing, cluster extraction method, ordinal clustering methods, Complete Link, term loss, recognition faults, feature extraction, human factors, optical character recognition, interactive systems, document image processing, user interaction, document clustering, visual databases, word processing |
13 | Philip J. Bernhard, Daniel J. Rosenkrantz |
Partitioning Message Patterns for Bundled Omega Networks. |
IEEE Trans. Parallel Distributed Syst. |
1994 |
DBLP DOI BibTeX RDF |
bundled omega networks, communication conflict, conflicting messages, interconnection links, on-line heuristics, computational complexity, interconnection network, heuristic, multiprocessor, partitioning, NP-complete, multiprocessor interconnection networks, communication complexity, telecommunication network routing, message routing, message patterns, performance ratio |
13 | Tao Yang 0009, Apostolos Gerasoulis |
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. |
IEEE Trans. Parallel Distributed Syst. |
1994 |
DBLP DOI BibTeX RDF |
trees(mathematics), DSC, low-complexityheuristic, dominant sequence clustering algorithm, completely connected processor, unbounded number, nonzero communication overhead, arbitrary directedacyclic task graphs, special classes, coarse-grain trees, fine-grain trees, general scheduling algorithms, ETF, scheduling, performance, parallel algorithms, computational complexity, parallel programming, NP-complete, directed graphs, DAGs, join, optimal schedules, MD, fork, parallel task scheduling |
13 | Xiaola Lin, Lionel M. Ni |
Multicast Communication in Multicomputer Networks. |
IEEE Trans. Parallel Distributed Syst. |
1993 |
DBLP DOI BibTeX RDF |
routing of messages, routing evaluation, switching technologies, graph theoretical, optimal multicast path, optimal multicast cycle, minimal Steiner tree, graph theory, message passing, NP-complete, hypercube, multiprocessor interconnection networks, heuristic algorithms, multicomputers, multicast communication, multicomputer networks, 2D-mesh |
13 | Yahui Zhu, Mohan Ahuja |
On Job Scheduling on a Hypercube. |
IEEE Trans. Parallel Distributed Syst. |
1993 |
DBLP DOI BibTeX RDF |
LDF algorithm, job preemption, minimum finish time schedule, list scheduling algorithm, absolute bound, scheduling, computational complexity, distributed algorithms, lower bound, NP-complete, hypercube, hypercube networks, scheduling algorithms, job scheduling |
13 | Elango Ganesan, Dhiraj K. Pradhan |
The Hyper-deBruijn Networks: Scalable Versatile Architecture. |
IEEE Trans. Parallel Distributed Syst. |
1993 |
DBLP DOI BibTeX RDF |
hyper-deBruijn networks, scalable versatile architecture, logarithmic diameter, optimal connectivity, optimal one-to-allbroadcasting, fault-tolerance, parallel architectures, fault tolerant computing, routing algorithms, hypercube networks, VLSI layout, complete binary trees, multiprocessor networks, decomposability, multidimensional meshes |
13 | Krishna V. Palem, Barbara B. Simons |
Scheduling Time-Critical Instructions on RISC Machines. |
ACM Trans. Program. Lang. Syst. |
1993 |
DBLP DOI BibTeX RDF |
RISC machine scheduling, NP-complete, latency, compiler optimization, register allocation, greedy algorithm, instruction scheduling, deadline, RISC, pipeline processor |
13 | Julian R. Ullmann |
Analysis of 2-D Occlusion by Subtracting Out. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1992 |
DBLP DOI BibTeX RDF |
2-D occlusion, subtracting out, complete systematic analysis, synthetically generated noise-free pictures, 2-D objects, computer vision, computer vision, computational complexity, polynomial-time algorithm, template matching, occluded objects |
13 | Sylvia C. Boyd, Hasan Ural |
On the Complexity of Generating Optimal Test Sequences. |
IEEE Trans. Software Eng. |
1991 |
DBLP DOI BibTeX RDF |
maximal overlapping, test subsequences, optimal test sequence generation, OTSG problem, computational complexity, protocols, NP-complete, finite state machine, program testing, communications protocols, finite automata, polynomial time, FSM, protocol testing |
13 | Ishfaq Ahmad, Arif Ghafoor |
Semi-Distributed Load Balancing For Massively Parallel Multicomputer Systems. |
IEEE Trans. Software Eng. |
1991 |
DBLP DOI BibTeX RDF |
massively parallel multicomputer systems, semidistributed approach, fully distributed approaches, two-level hierarchical control, independent symmetric regions, distance transitive graphs, scheduling points, fully distributed strategy, scheduling, distributed systems, computational complexity, load balancing, parallel architectures, multiprocessor interconnection networks, parallel machines, multiprocessor system, NP-complete problem, simulation study, interconnection structure, interconnection structures, state information, Hadamard matrix, combinatorial structure |
13 | Ouri Wolfson, Amir Milo |
The Multicast Policy and Its Relationship to Replicated Data Placement. |
ACM Trans. Database Syst. |
1991 |
DBLP DOI BibTeX RDF |
complexity, message passing, NP-Complete, computer network, file allocation |
13 | Nicolien J. Drost |
Algebraic Formulations of Trace Theory. |
CONCUR |
1991 |
DBLP DOI BibTeX RDF |
trace models, infinite processes, verification, concurrency, process algebra, alternating bit protocol, complete axiomatization |
13 | Sheau-Dong Lang, Yannis Manolopoulos |
Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files. |
IEEE Trans. Software Eng. |
1990 |
DBLP DOI BibTeX RDF |
nonrecurrent expressions, partly unsuccessful batched searching, complete j-ary tree files, nonreplacement models, search queries, block accesses, hierarchical file structures, batch processing (computers), data structures, database management systems, trees (mathematics), search problems, information retrieval systems |
13 | Thomas J. Sager, Shi-Jen Lin |
A Color-Exchange Algorithm for Exact Graph Coloring. |
Great Lakes Computer Science Conference |
1989 |
DBLP DOI BibTeX RDF |
scheduling, algorithms, NP-Complete, branch-and-bound, graph-coloring, chromatic number |
13 | Yaoxue Zhang, Kaoru Takahashi, Norio Shiratori, Shoichi Noguchi |
An Interactive Protocol Synthesis Algorithm Using a Global State Transition Graph. |
IEEE Trans. Software Eng. |
1988 |
DBLP DOI BibTeX RDF |
interactive protocol synthesis algorithm, global state transition graph, global state transition graph, deadlock avoidance rules, complete reception, protocols, graph theory, finite-state machines, finite automata, buffer overflow, production rules, interactive programming, deadlock freeness |
Displaying result #501 - #600 of 30405 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ 15][ >>] |
|