|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8195 occurrences of 3892 keywords
|
|
|
Results
Found 19615 publication records. Showing 19615 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
55 | Yeu-hsiung Liang |
A parsing method on l-1 bounded context parsing. |
ACM Southeast Regional Conference |
1980 |
DBLP DOI BibTeX RDF |
Bounded Context Acceptor, Bounded right context, Extended Bounded Context Acceptor, Normal form grammar, pushdown automaton, Parsing, Context free grammar |
47 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx |
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs |
47 | Petr A. Golovach, Dimitrios M. Thilikos |
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
Bounded length disjoint paths, Bounded length cuts, Parameterized Complexity, Parameterized Algorithms |
46 | Ran Duan, Seth Pettie |
Bounded-leg distance and reachability oracles. |
SODA |
2008 |
DBLP BibTeX RDF |
|
44 | Klaus Ambos-Spies, Levke Bentzien |
Separating NP-Completeness Notions under Strong Hypotheses. |
CCC |
1997 |
DBLP DOI BibTeX RDF |
NP-completeness notions separation, strong hypotheses, NP-m-completeness, NP-T-completeness, bounded-query reducibilities, resource bounded Baire category concept, computational complexity, resource bounded measure |
44 | Borzoo Bonakdarpour, Sandeep S. Kulkarni |
Automated Incremental Synthesis of Timed Automata. |
FMICS/PDMC |
2006 |
DBLP DOI BibTeX RDF |
Bounded liveness, Bounded response, Real-time, Formal methods, Synthesis, Transformation, Timed automata |
43 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-randomness tradeoffs for bounded depth arithmetic circuits. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, hardness-randomness tradeoffs, identity testing, lower bounds, arithmetic circuits |
43 | Wenhui Zhang |
Bounded Semantics of CTL and SAT-Based Verification. |
ICFEM |
2009 |
DBLP DOI BibTeX RDF |
|
43 | John W. Carr III |
Error Bounds for the Runge-Kutta Single-Step Integration Process. |
J. ACM |
1958 |
DBLP DOI BibTeX RDF |
|
40 | Xiangyu Luo, Kaile Su, Abdul Sattar 0001, Mark Reynolds 0001 |
Verification of Multi-agent Systems Via Bounded Model Checking. |
Australian Conference on Artificial Intelligence |
2006 |
DBLP DOI BibTeX RDF |
temporal epistemic logic, bounded semantics, multi-agent systems, bounded model checking |
40 | Gabriel Taubin, Fernando Cukierman, Steve Sullivan, Jean Ponce, David J. Kriegman |
Parameterized Families of Polynomials for Bounded Algebraic Curve and Surface Fitting. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1994 |
DBLP DOI BibTeX RDF |
bounded algebraic curve fitting, model-based computer vision tasks, bounded zero sets, computer vision, geometric models, polynomials, polynomials, matrix algebra, surface fitting, surface fitting, curve fitting, shape descriptors, data sets |
40 | Dino Pedreschi, Salvatore Ruggieri |
Bounded Nondeterminism of Logic Programs. |
Ann. Math. Artif. Intell. |
2004 |
DBLP DOI BibTeX RDF |
universal termination, bounded nondeterminism, strong termination, logic programming |
39 | Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard |
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
37 | Pu Huang, Charlie C. L. Wang |
Volume and complexity bounded simplification of solid model represented by binary space partition. |
Symposium on Solid and Physical Modeling |
2010 |
DBLP DOI BibTeX RDF |
volume bounded, solid model, simplification, binary space partition, complexity bounded |
37 | Salil P. Vadhan |
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model. |
J. Cryptol. |
2004 |
DBLP DOI BibTeX RDF |
Everlasting security, Space-bounded adversaries, Averaging samplers, Expander graphs, Extractors, Unconditional security, Bounded-storage model |
36 | Yehuda Afek, Eran Shalom |
Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
Consensus hierarchy, Common2, Bounded-use, Bounded-size, Long-lived, Fetch&Add, Queues, Stacks, Set, Wait-free, Swap |
36 | Jack Jie Dai |
An Outer-Measure Approach for Resource-Bounded Measure. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Carathéodory definition, Computational complexity, Martingale, Resource-bounded measure |
36 | Kun Zhao, Yingjie Tian 0001, Naiyang Deng |
Robust Unsupervised and Semi-supervised Bounded v - Support Vector Machines. |
ISNN (2) |
2009 |
DBLP DOI BibTeX RDF |
Bounded ?? support vector machines, Robust, Semi-supervised learning, Unsupervised learning, Semi-definite programming |
36 | Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaard |
Progress guarantee for parallel programs via bounded lock-freedom. |
PLDI |
2009 |
DBLP DOI BibTeX RDF |
bounded lock-freedom, lock-freedom, progress guarantees, model checking, parallel computation |
36 | Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier |
Bounded Self-Stabilizing Petri Nets. |
Applications and Theory of Petri Nets |
1991 |
DBLP DOI BibTeX RDF |
bounded Petri nets, computational complexity, Self-stabilization |
36 | Jaroslav Nesetril, Patrice Ossona de Mendez |
Linear time low tree-width partitions and algorithmic consequences. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor |
36 | Mohammad Taghi Hajiaghayi, Naomi Nishimura |
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Liam Roditty, Michael Segal 0001 |
On bounded leg shortest paths problems. |
SODA |
2007 |
DBLP BibTeX RDF |
|
36 | Orna Kupferman, Moshe Y. Vardi |
On Bounded Specifications. |
LPAR |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Cheng-Shang Chang, Duan-Shin Lee, Ching-Ming Lien |
Load balanced Birkhoff-von Neumann switches with resequencing. |
SIGMETRICS Perform. Evaluation Rev. |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Nader H. Bshouty, Yishay Mansour |
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
constant bounded product distribution, /spl epsiv/-approximation, j-disjoint DNF, bounded term size, learning (artificial intelligence), decision trees, interpolation, interpolation, finite fields, polynomials, decision theory, learning algorithms, learnability, multivariate polynomials, membership queries, bounded degree |
33 | Afrodita Iorgulescu |
Classes of examples of pseudo-MV algebras, pseudo-BL algebras and divisible bounded non-commutative residuated lattices. |
Soft Comput. |
2010 |
DBLP DOI BibTeX RDF |
Pseudo-Wajsberg algebra, Pseudo-BCK algebra, Pseudo-Hájek(pP) algebra, Divisible bounded non-commutative residuated lattice, Divisible bounded pseudo-BCK(pP) lattice, Pseudo-MV algebra, Pseudo-BL algebra |
33 | Moonseong Kim, Gunu Jho, Hyunseung Choo |
Advanced Bounded Shortest Multicast Algorithm for Delay Constrained Minimum Cost. |
International Conference on Computational Science (1) |
2007 |
DBLP DOI BibTeX RDF |
Multicast Routing Algorithm, Delay-Bounded Minimum Steiner Tree (DBMST) Problem and Bounded Shortest Multicast Algorithm (BSMA) |
33 | Xiangyu Luo, Kaile Su, Abdul Sattar 0001, Qingliang Chen, Guanfeng Lv |
Bounded model checking knowledge and branching time in synchronous multi-agent systems. |
AAMAS |
2005 |
DBLP DOI BibTeX RDF |
bounded semantics, temporal epistemic logic, translation to SAT, bounded model checking |
33 | Andy Jinqing Yu, Gianfranco Ciardo, Gerald Lüttgen |
Decision-diagram-based techniques for bounded reachability checking of asynchronous systems. |
Int. J. Softw. Tools Technol. Transf. |
2009 |
DBLP DOI BibTeX RDF |
Edge-valued decision diagrams, Petri net, Formal verification, BDDs, Reachability analysis, Bounded model checking, Asynchronous design, ADDs |
33 | Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry |
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method. |
FM |
2009 |
DBLP DOI BibTeX RDF |
Scope-bounded checking, computation graph, first-order logic, SAT, Alloy, white-box testing, lightweight formal method |
33 | Joan Gispert, Antoni Torrens |
Boolean representation of bounded BCK-algebras. |
Soft Comput. |
2008 |
DBLP DOI BibTeX RDF |
Bounded BCK-algebras, Boolean factor elements, Weak Boolean product, Pierce BCK-representation |
33 | Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Jing Sun 0002 |
Compositional encoding for bounded model checking. |
Frontiers Comput. Sci. China |
2008 |
DBLP DOI BibTeX RDF |
Communication Sequential Processes (CSP), Linear Temporal Logic (LTL), bounded model checking |
33 | Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Jing Sun 0002 |
Bounded Model Checking of Compositional Processes. |
TASE |
2008 |
DBLP DOI BibTeX RDF |
Compositional Processes, Tool, Bounded Model Checking |
33 | Morteza Moniri |
Preservation theorems for bounded formulas. |
Arch. Math. Log. |
2007 |
DBLP DOI BibTeX RDF |
Polynomial induction, Model completeness, Universal theory, Quantifier elimination, Intuitionistic logic, NP, Bounded arithmetic, Polynomial hierarchy, Kripke model |
33 | Kun Zhao, Ying-Jie Tian 0001, Naiyang Deng, Hiroshi Kuwajima, Takashi Washio |
Robust Unsupervised and Semisupervised Bounded C-Support Vector Machines. |
ICDM Workshops |
2007 |
DBLP DOI BibTeX RDF |
Bounded Support Vector Machines, robust, semi- supervised learning, unsupervised learning, Semi- definite Programming |
33 | Man Ho Au, Qianhong Wu, Willy Susilo, Yi Mu 0001 |
Compact E-Cash from Bounded Accumulator. |
CT-RSA |
2007 |
DBLP DOI BibTeX RDF |
compact e-cash, bounded accumulator, bilinear pairings |
33 | Sean Safarpour, Görschwin Fey, Andreas G. Veneris, Rolf Drechsler |
Utilizing don't care states in SAT-based bounded sequential problems. |
ACM Great Lakes Symposium on VLSI |
2005 |
DBLP DOI BibTeX RDF |
don't care states, unreachable states, satisfiability, bounded model checking, sequential equivalence checking |
33 | Stefan Dziembowski, Ueli M. Maurer |
Optimal Randomizer Efficiency in the Bounded-Storage Model. |
J. Cryptol. |
2004 |
DBLP DOI BibTeX RDF |
Information theory, Unconditional security, One-time pad, Bounded-storage model, Min-entropy |
33 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann |
Match-Bounded String Rewriting Systems. |
Appl. Algebra Eng. Commun. Comput. |
2004 |
DBLP DOI BibTeX RDF |
Match-bounded, Termination, Semi-Thue System, String Rewriting System |
33 | Yu Wang 0003, Xiang-Yang Li 0001 |
Localized construction of bounded degree and planar spanner for wireless ad hoc networks. |
DIALM-POMC |
2003 |
DBLP DOI BibTeX RDF |
wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree |
33 | Wim H. Hesselink |
Progress Under Bounded Fairness. |
Distributed Comput. |
1999 |
DBLP DOI BibTeX RDF |
Bounded fairness, Concurrent data object, Fault tolerance, Memory management, Client server architecture |
33 | R. David, Janusz A. Brzozowski, Helmut Jürgensen |
Testing for Bounded Faults in RAMs. |
J. Electron. Test. |
1997 |
DBLP DOI BibTeX RDF |
bounded fault, testing, Markov chain, random test, RAM, test length, deterministic test |
32 | John Watrous |
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. |
CCC |
1999 |
DBLP DOI BibTeX RDF |
quantum computation, graph connectivity, space-bounded computation |
32 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. |
IPCO |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Jik H. Chang, Oscar H. Ibarra, Michael A. Palis |
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
32 | Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu, Nir Piterman |
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions. |
FMSB |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |
Degree Bounded Network Design with Metric Costs. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Conghua Zhou, Decheng Ding |
Improved SAT Based Bounded Model Checking. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
Isomorphism for Graphs of Bounded Distance Width. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Distance pathwidth, Distance treewidth, Graph isomorphism, Fixed parameter tractability |
32 | Andrei Voronkov |
Logic Programming with Bounded Quantifiers. |
RCLP |
1991 |
DBLP DOI BibTeX RDF |
|
29 | Joe Kilian |
On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
bounded-interaction proofs, bounded-interaction, noninteractive zero-knowledge proofs, committed bits, complexity, cryptographic primitive |
29 | Leszek Aleksander Kolodziejczyk, Neil Thapen |
The Polynomial and Linear Hierarchies in V0. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
prefix parity, linear hierarchy, bounded depth circuits, bounded arithmetic |
29 | Gerardo Lamastra, Giuseppe Lipari, Giorgio C. Buttazzo, Antonino Casile, Fabio Conticelli |
HARTIK 3.0: a portable system for developing real-time applications. |
RTCSA |
1997 |
DBLP DOI BibTeX RDF |
HARTIK 3.0, soft multimedia, Intel 80/spl times/86 processors, DEC Alpha AXP-PCI-33, bounded blocking time, chained blocking, time bounded communication paradigm, distributed systems, embedded systems, predictability, deadlock, timing constraints, portability, toolkit, dynamic scheduling, real-time applications, software portability, microcontrollers, application designer, portable system |
29 | Tal Moran, Ronen Shaltiel, Amnon Ta-Shma |
Non-interactive Timestamping in the Bounded-Storage Model. |
J. Cryptol. |
2009 |
DBLP DOI BibTeX RDF |
Unbalanced expander graphs, Timestamping, Randomness extractors, Bounded-storage model |
29 | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
Resource Allocation in Bounded Degree Trees. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation |
29 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala |
Analyzing Security Protocols Using Time-Bounded Task-PIOAs. |
Discret. Event Dyn. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Time-bounded task-PIOAs, Probabilistic input/output automata, Security protocols, Oblivious transfer |
29 | Zhi-Hong Tao, Conghua Zhou, Zhong Chen, Lifu Wang |
Bounded Model Checking of CTL. |
J. Comput. Sci. Technol. |
2007 |
DBLP DOI BibTeX RDF |
symbolic model checking, bounded model checking, QBF, CTL* |
29 | Olivier Y. de Vel |
Learning Semi-Structured Document Categorization Using Bounded-Length Spectrum Sub-Sequence Kernels. |
Data Min. Knowl. Discov. |
2006 |
DBLP DOI BibTeX RDF |
bounded-length spectrum, support vector machines, kernel, suffix tree, digital forensics, computer forensics, document categorization, Naive Bayes classifier |
29 | Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala |
Bounded Model Checking for Weak Alternating Büchi Automata. |
CAV |
2006 |
DBLP DOI BibTeX RDF |
Weak Alternating Büchi Automata, Bounded Model Checking, PSL, NuSMV |
29 | Keijo Heljanko, Tommi A. Junttila, Timo Latvala |
Incremental and Complete Bounded Model Checking for Full PLTL. |
CAV |
2005 |
DBLP DOI BibTeX RDF |
PLTL, Complete, Bounded Model Checking, Incremental, NuSMV |
29 | Erkay Savas, Berk Sunar |
A Practical and Secure Communication Protocol in the Bounded Storage Model. |
ICN (2) |
2005 |
DBLP DOI BibTeX RDF |
hyper-encryption, information theoretical security, pervasive networks, Bounded storage model |
29 | Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila |
Simple Is Better: Efficient Bounded Model Checking for Past LTL. |
VMCAI |
2005 |
DBLP DOI BibTeX RDF |
Past LTL, Bounded Model Checking, NuSMV |
29 | Chris Olston, Jock D. Mackinlay |
Visualizing Data with Bounded Uncertainty. |
INFOVIS |
2002 |
DBLP DOI BibTeX RDF |
bounded uncertainty, uncertainty visualization |
29 | Martin Fränzle |
Take It NP-Easy: Bounded Model Construction for Duration Calculus. |
FTRTFT |
2002 |
DBLP DOI BibTeX RDF |
Discrete-time Duration Calculus, Bounded model construction, Complexity, Model construction |
29 | Raymond Cunningham, Vinny Cahill |
Time bounded medium access control for ad hoc networks. |
POMC |
2002 |
DBLP DOI BibTeX RDF |
mobile ad hoc networks, medium access control, time bounded |
29 | Lu Guoying, Liu Zemin, Zhou Zheng |
Multicast Routing Based on Ant Algorithm for Delay-Bounded and Load-Balancing Traffic. |
LCN |
2000 |
DBLP DOI BibTeX RDF |
delay-bounded traffic, load-balancing traffic, multicast destinations, ant-network model, OPNET simulation software, congested nodes, packet switched computer communication networks, computer networks, packet switching, multicast routing, telecommunication network routing, real-time communications, multicast communication, telecommunication traffic, ant algorithm |
29 | Doron Drusinsky, David Harel |
On the Power of Bounded Concurrency I: Finite Automata. |
J. ACM |
1994 |
DBLP DOI BibTeX RDF |
bounded cooperative concurrency, statecharts, finite automata, nondeterminism, alternation, succinctness, omega-automata |
29 | Franz-Josef Brandenburg |
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. |
RTA |
1991 |
DBLP DOI BibTeX RDF |
boundary and confluent graph grammars, operator normal form, graph languages of bounded degree, graph grammars |
29 | Tamás Király, Lap Chi Lau, Mohit Singh |
Degree Bounded Matroids and Submodular Flows. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Xianning Li, Xianwei Zhou |
Bounded-Delay, Probability-Based Routing in Intermittently Connected Mobile Ad Hoc Networks. |
ICDCS Workshops |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Artur Czumaj, Christian Sohler |
On testable properties in bounded degree graphs. |
SODA |
2007 |
DBLP BibTeX RDF |
|
29 | Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan |
Bounded CCA2-Secure Encryption. |
ASIACRYPT |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Ming-Dou Ker, Che-Hao Chuang |
ESD protection circuits with novel MOS-bounded diode structures. |
ISCAS (5) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Daya Ram Gaur, Ramesh Krishnamurti |
Self-Duality of Bounded Monotone Boolean Functions and Related Problems. |
ALT |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
Isomorphism for Graphs of Bounded Distance Width. |
CIAC |
1997 |
DBLP DOI BibTeX RDF |
|
29 | Oscar H. Ibarra, Tao Jiang 0001, Nicholas Q. Trân, Hui Wang 0008 |
On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
28 | Arun Subbiah, Douglas M. Blough |
Distributed Diagnosis in Dynamic Fault Environments. |
IEEE Trans. Parallel Distributed Syst. |
2004 |
DBLP DOI BibTeX RDF |
fault tolerance, synchronous systems, Distributed diagnosis, dynamic failures |
28 | David R. Wood |
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman |
An exact almost optimal algorithm for target set selection in social networks. |
EC |
2009 |
DBLP DOI BibTeX RDF |
bounded tree-width algorithm, bounded tree-width lower-bound, target set selection, social networks, viral marketing |
26 | Xiang Yu, Ian Li-Jin Thng, Yuming Jiang 0001, Chunming Qiao |
Queueing processes in GPS and PGPS with LRD traffic inputs. |
IEEE/ACM Trans. Netw. |
2005 |
DBLP DOI BibTeX RDF |
LRD isolation, Weibull bounded, Weibull bounded burstiness, queueing process, QoS, long range dependent, generalized processor sharing |
26 | Deepak Goyal |
Transformational Derivation of an Improved Alias Analysis Algorithm. |
High. Order Symb. Comput. |
2005 |
DBLP DOI BibTeX RDF |
may-alias analysis, dominated convergence, finite differencing, workset algorithm, alias graph, sparse evaluation graph, input-bounded, output-bounded, continuity, pointer analysis, control flow graph |
25 | Roy Friedman, Alex Kogan |
Brief announcement: deterministic dominating set construction in networks with bounded degree. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
dominating sets, bounded degree graphs, distributed approximation algorithms |
25 | Jian Yu, Hui Yang, Chao Yu |
Structural stability and robustness to bounded rationality for non-compact cases. |
J. Glob. Optim. |
2009 |
DBLP DOI BibTeX RDF |
Robustness, Nash equilibrium, Multiobjective optimization, Fixed point, Bounded rationality, Structural stability |
25 | Eyjolfur Ingi Asgeirsson, Cliff Stein 0001 |
Bounded-space online bin cover. |
J. Sched. |
2009 |
DBLP DOI BibTeX RDF |
Bin cover, Bounded-space, Markov chains, Online |
25 | Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro |
A Metric Encoding for Bounded Model Checking. |
FM |
2009 |
DBLP DOI BibTeX RDF |
Bounded model checking, metric temporal logic |
25 | Borzoo Bonakdarpour, Sandeep S. Kulkarni |
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery. |
FM |
2009 |
DBLP DOI BibTeX RDF |
Bounded-time recovery, Phased recovery, Fault-tolerance, Real-time, Program transformation, Program synthesis |
25 | Nir Naaman, Raphael Rom |
Average Case Analysis of Bounded Space Bin Packing Algorithms. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Discrete item size distribution, Bounded space, Algorithms, Bin packing, Average case analysis |
25 | Borzoo Bonakdarpour, Sandeep S. Kulkarni |
Masking Faults While Providing Bounded-Time Phased Recovery. |
FM |
2008 |
DBLP DOI BibTeX RDF |
Bounded-time recovery, Phased recovery, Fault-tolerance, Real-time, Formal methods, Synthesis, Transformation |
25 | Arindam Khaled, Bryant A. Julstrom |
Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
bounded labels, labeled spanning trees, genetic algorithms, local search, greedy heuristics |
25 | Tobias Schüle, Klaus Schneider 0001 |
Bounded model checking of infinite state systems. |
Formal Methods Syst. Des. |
2007 |
DBLP DOI BibTeX RDF |
Temporal logic hierarchy, Global model checking, Local model checking, Bounded model checking, Infinite state systems |
25 | Martin Fränzle, Christian Herde |
HySAT: An efficient proof engine for bounded model checking of hybrid systems. |
Formal Methods Syst. Des. |
2007 |
DBLP DOI BibTeX RDF |
Verification, Hybrid systems, Satisfiability, Decision procedures, Bounded model checking, Infinite-state systems |
25 | Alok Singh 0001, Ashok Kumar Gupta |
Improved heuristics for the bounded-diameter minimum spanning tree problem. |
Soft Comput. |
2007 |
DBLP DOI BibTeX RDF |
Bounded-diameter minimum spanning tree problem, Uniform order-based crossover, Constrained optimization, Greedy heuristic, Steady-state genetic algorithm |
25 | Andreas Malcher, Giovanni Pighizzini |
Descriptional Complexity of Bounded Context-Free Languages. |
Developments in Language Theory |
2007 |
DBLP DOI BibTeX RDF |
finite-turn pushdown automata, recursive trade-offs, bounded languages, descriptional complexity, automata and formal languages |
25 | Yu Wang 0003, Xiang-Yang Li 0001 |
Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks. |
Mob. Networks Appl. |
2006 |
DBLP DOI BibTeX RDF |
Wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree |
25 | Fredrik Kuivinen |
Approximability of Bounded Occurrence Max Ones. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
Bounded occurrence, Max Ones, Approximability, Matching, Constraint satisfaction problems |
25 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
Constructing Plane Spanners of Bounded Degree and Low Weight. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Low weight graphs, Computational geometry, Planar graphs, Spanners, Bounded degree graphs |
25 | Ronny Krashinsky, Hari Balakrishnan |
Minimizing Energy for Wireless Web Access with Bounded Slowdown. |
Wirel. Networks |
2005 |
DBLP DOI BibTeX RDF |
bounded slowdown, protocols, Web, wireless, TCP, IEEE 802.11, HTTP, energy saving, power saving |
25 | Sergey Bereg, David G. Kirkpatrick |
Curvature-bounded traversals of narrow corridors. |
SCG |
2005 |
DBLP DOI BibTeX RDF |
curvarure-bounded traversals, computational geometry, motion planning |
25 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer |
On the locality of bounded growth. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
bounded growth, distributed algorithms, locality, dominating sets, packing, covering, unit disk graphs, maximal independent set, network decomposition, doubling dimension |
Displaying result #1 - #100 of 19615 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|