|
|
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 |
18 | Sanjoy K. Baruah, Steve Goddard, Kevin Jeffay |
Feasibility concerns in PGM graphs with bounded buffers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECCS ![In: 3rd IEEE International Conference on Engineering of Complex Computer Systems (ICECCS '97), 8-12 September 1997, Lake Como, Italy, pp. 130-, 1997, IEEE Computer Society, 0-8186-8126-8. The full citation details ...](Pics/full.jpeg) |
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 |
18 | T. Dornseifer, Christoph Pflaum |
Discretization of Elliptic Differential Equations on Curvilinear Bounded Domains with Sparse Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 56(3), pp. 197-214, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
elliptic differential equation, discretization of curvilinear bounded domains, finite elements, Sparse grid |
18 | Friedhelm Meyer auf der Heide, Christian Scheideler |
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 370-379, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
online protocols, deterministic protocol, arbitrary permutations, r-replicated s-ary Multibutterflies, multiprocessor interconnection networks, deterministic routing, arbitrary networks, bounded buffers |
18 | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 390-399, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
general approach, dynamic packet routing, static routing, injection rate, stability, packet switching, routing algorithm, sufficient condition, butterfly, steady state analysis, worst case bounds, bounded buffers |
18 | Yoav Freund, Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire |
Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 332-341, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
repeated games playing, computationally bounded adversaries, penny-matching, classically studied finite automata, learning (artificial intelligence), game theory, finite automata, learning algorithm, computational efficiency |
18 | Mike Paterson, Aravind Srinivasan |
Contention Resolution with Bounded Delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 104-113, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
distributed contention resolution, stable protocol, resource request, protocols, resource allocation, distributed processing, contention resolution, bounded delay |
18 | Sergei G. Vorobyov |
Structural Decidable Extensions of Bounded Quantification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, January 23-25, 1995, pp. 164-175, 1995, ACM Press, 0-89791-692-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
(W)SnS, bounded universal type quantification, essential undecidability, parametric and inheritance polymorphisms, second-order polymorphic typed ?-calculus, system F?, decidability, subtyping, undecidability |
18 | T. Grimm, Johann Mitlöhner, W. Schönfeldinger |
Bounded Rationality and Adaptive Agents in Economic Modeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Proceedings of the 1995 International Conference on Applied Programming Languages, APL 1995, San Antonio, Texas, USA, June 4-8, 1995., pp. 56-62, 1995, ACM, 0-89791-722-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
economic simulation, economic modelling, adaptive agents, bounded rationality |
18 | György Turán, Farrokh Vatan |
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 553-564, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
explicit nonlinear lower bounds, computation of Boolean functions, bounded fan-in, real-valued functions, sign-representation, n-variable function, piecewise linear circuits, complexity, upper bounds, nondeterminism, analog circuits |
18 | Hussein M. Alnuweiri |
A New Class of Optimal Bounded-Degree VLSI Sorting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(6), pp. 746-752, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
VLSI sorting networks, optimal VLSI sorters, rotate-sort, enumeration-sort, reduced-area, K-shuffle layouts, VLSI, optimisation, logic design, sorting, time complexity, bounded-degree |
18 | Richard Chang 0001, William I. Gasarch |
On Bounded Queries and Approximation ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 547-556, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
NP-optimization problems, NP oracle, maximum clique size, computational complexity, approximation, graph coloring, set cover, complexity measure, approximation factor, bounded queries |
18 | Shenfeng Chen, John H. Reif |
Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 104-112, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
computational geometry problems, entropy bounded inputs, large database operations, sort, sorting, convex hull, priority queue, compression ratio |
18 | Madhavan Mukund, Milind A. Sohoni |
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings, pp. 388-399, 1993, Springer, 3-540-57529-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
bounded time-stamping, asynchronous automata, Distributed algorithms, synchronous communication |
18 | Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman |
On the Fault Tolerance of Some Popular Bounded-Degree Networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 542-552, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
bounded-degree networks, worst-case faults, shuffle-exchange graph, constant-factor slowdown, routing packets, fault tolerance, parallel computation, hypercubic networks, binary trees, meshes of trees |
18 | Paul Havlak, Ken Kennedy |
An Implementation of Interprocedural Bounded Regular Section Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(3), pp. 350-360, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
interprocedural bounded regular section analysis, subarrays, production compiler, high-level language constructs, programmingsupport systems, LINPACK library, linear algebra subroutines, RiceCompiler Evaluation Program Suite, RiCEPS, application codes, scientific disciplines, modular programming style, parallel programming, program testing, program compilers, dependence analysis, optimizing compilers, procedure calls |
18 | Jirí Matousek 0001, Emo Welzl, Lorenz Wernisch |
Discrepancy and epsilon-approximations for bounded VC-dimension ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 424-430, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
geometric settings, in -approximations, bounded VC-dimension, two-coloring, m-point subset, upper bounds, discrepancy, polylogarithmic factors |
18 | Rolf Klein |
Walking an Unknown Street with Bounded Detour ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 304-313, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
bounded detour, boundary chains, mutually weakly visible, onboard vision, short path, lower bound, mobile robot, polygon, vertices |
18 | Moshe Morgenstern |
Explicit Construction of Natural Bounded Concentrators ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 392-397, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
linear families, natural bounded concentrators, direct construction, explicit construction |
18 | Kieran T. Herley |
Efficient Simulations of Small Shared Memories on Bounded Degree Networks (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 390-395, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
small shared memories, bounded degree networks, PRAM algorithms, simulation, parallel random-access machine, PRAM |
18 | Anne Condon, Richard J. Lipton |
On the Complexity of Space Bounded Interactive Proofs (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 462-467, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
space bounded interactive proofs, finite-state verifiers, Markov chains, finite-state machines, upper bound, undecidable, interactive proof systems, recursively enumerable language |
18 | Douglas B. West, Prithviraj Banerjee |
On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 37(9), pp. 1148-1151, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
bounded fan-in, service ports, graph-theoretic problem, graph theory, linear programming, linear programming, computer networks, communication networks, users, bipartite graph |
18 | Rob J. van Glabbeek |
Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings, pp. 336-347, 1987, Springer, 3-540-17219-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
& Phrases Concurrency, Approximation Induction Principle, Bounded Nondeterminism, Fairness, Abstraction, Consistency, Process algebra, Recursion, Bisimulation, Liveness, ACP |
18 | Antti Valmari |
Software model checking is a rich research field. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 11(1), pp. 1-11, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Distributed model checking, Directed model checking, Satisfiability, Symbolic execution, Bounded model checking, State space, Partial-order methods |
18 | Oscar H. Ibarra, Ömer Egecioglu |
Hierarchies and Characterizations of Stateless Multicounter Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 408-417, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Stateless multicounter machine, reversal-bounded, non- realtime, stateless multihead automata, hierarchy, closure properties, semilinear set |
18 | Tim Nieberg, Johann L. Hurink, Walter Kern |
Approximation schemes for wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(4), pp. 49:1-49:17, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded growth, Wireless ad-hoc networks, PTAS, maximum independent set, minimum dominating set |
18 | Jiong Guo, Rolf Niedermeier, Daniel Raible 0001 |
Improved Algorithms and Complexity Results for Power Domination in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(2), pp. 177-202, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Graphs of bounded treewidth, (Power) domination in graphs, Computational complexity, Graph algorithms, Parameterized complexity, Design and analysis of algorithms, Fixed-parameter algorithms |
18 | Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro |
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings, pp. 290-304, 2008, Springer, 978-3-540-85761-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bi-infinite words and automata, Bounded model checking, metric temporal logic |
18 | Alexander A. Sherstov |
The pattern matrix method for lower bounds on quantum communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 85-94, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximate degree of boolean functions, bounded-error communication, quantum communication complexity, lower bounds |
18 | Anita Raja, Victor R. Lesser |
A framework for meta-level control in multi-agent systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Auton. Agents Multi Agent Syst. ![In: Auton. Agents Multi Agent Syst. 15(2), pp. 147-196, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Meta-level control architecture, Multi-agent systems, Bounded rationality |
18 | Sylvain Perifel |
Symmetry of Information and Nonuniform Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings, pp. 315-327, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
nonuniform lower bounds, resource-bounded Kolmogorov complexity, symmetry of information, computational complexity |
18 | João Muranho, Paula Prata, Mário Zenha Rela, João Gabriel Silva |
Failure Boundedness in Discrete Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LADC ![In: Dependable Computing, Third Latin-American Symposium, LADC 2007, Morella, Mexico, September 26-28, 2007, Proceedings, pp. 160-169, 2007, Springer, 978-3-540-75293-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Failure avoidance, Discrete applications, Fail-bounded model, Experimental Dependability Evaluation, Petri nets |
18 | Andreas Jakoby, Till Tantau |
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 216-227, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs |
18 | Stephen A. Cook, Neil Thapen |
The strength of replacement in weak arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(4), pp. 749-764, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
cryptography, PV, Bounded arithmetic |
18 | Robert Goldblatt |
Maps and Monads for Modal Frames. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 83(1-3), pp. 309-331, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
modal map, bounded morphism, descriptive frame, equivalence of categories, reflective subcategory, Kleisli category, duality, monad |
18 | Kun Zhao, Ying-Jie Tian 0001, Naiyang Deng |
Unsupervised and Semi-Supervised Two-class Support Vector Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 813-817, 2006, IEEE Computer Society, 0-7695-2702-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bounded Support Vector Machines, unsupervised learning, Semidefinite Programming, margin, semisupervised learning |
18 | Sriram V. Pemmaraju, Imran A. Pirwani |
Energy conservation via domatic partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2006, Florence, Italy, May 22-25, 2006, pp. 143-154, 2006, ACM, 1-59593-368-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
domatic partition, growth-bounded graphs, distributed algorithms, metric space, dominating sets, unit disk graphs, maximal independent sets, network decomposition, doubling dimension, unit ball graphs |
18 | Tianyun Ni, Ahmad H. Nasri |
Tuned Ternary Quad Subdivision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing - GMP 2006, 4th International Conference, Pittsburgh, PA, USA, July 26-28, 2006, Proceedings, pp. 441-450, 2006, Springer, 3-540-36711-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
ternary, bounded curvature, convex hull, Subdivision |
18 | Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel |
Towards small world emergence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 225-232, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded growth, distributed algorithms, routing algorithms, small world |
18 | Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos |
Datalog programs and their persistency numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 6(3), pp. 481-518, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bounded-tree width hypergraphs, persistency numbers, persistent variables, program transformations, Datalog, finite automata, Boundedness |
18 | Lan Liu 0001, Xi Chen 0001, Jing Xiao, Tao Jiang 0001 |
Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 370-379, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
L-reduction, positive result, negative result, bounded number, mates, complexity, approximation, children, SNP, recombinant, Haplotyping, pedigree |
18 | Eugene Eberbach |
Decision Theory = Performance Measure Theory + Uncertainty Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSFDGrC (1) ![In: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 10th International Conference, RSFDGrC 2005, Regina, Canada, August 31 - September 3, 2005, Proceedings, Part I, pp. 551-560, 2005, Springer, 3-540-28653-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
resource-bounded reasoning, uncertainty, process algebra, problem solving, decision theory |
18 | Malay K. Ganai, Aarti Gupta, Pranav Ashar |
Beyond safety: customized SAT-based model checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 42nd Design Automation Conference, DAC 2005, San Diego, CA, USA, June 13-17, 2005, pp. 738-743, 2005, ACM, 1-59593-058-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
circuit cofactoring, unbounded model checking, formal verification, SAT, liveness, bounded model checking, LTL |
18 | Shougo Ogata, Tatsuhiro Tsuchiya, Tohru Kikuno |
SAT-Based Verification of Safe Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis: Second International Conference, ATVA 2004, Taipei, Taiwan, ROC, October 31-November 3, 2004. Proceedings, pp. 79-92, 2004, Springer, 3-540-23610-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Petri nets, SAT, Bounded model checking |
18 | Marcelo Bertalmío, Luminita A. Vese, Guillermo Sapiro, Stanley J. Osher |
Simultaneous Structure and Texture Image Inpainting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR (2) ![In: 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2003), 16-22 June 2003, Madison, WI, USA, pp. 707-712, 2003, IEEE Computer Society, 0-7695-1900-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
filling-in, bounded variation, texture, texture synthesis, structure, Inpainting, image decomposition |
18 | Taehwan Kim 0002, Tülay Adali |
Fully Complex Multi-Layer Perceptron Network for Nonlinear Signal Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 32(1-2), pp. 29-43, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
nonlinear adaptive signal processing, fully complex neural network, split complex neural network, elementary transcendental functions, bounded almost everywhere, analytic almost everywhere |
18 | Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa |
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 579-590, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Reversal-bounded counters, commutation of languages, context-free languages, combinatorics on words, morphisms |
18 | Anca Muscholl, Doron A. Peled |
From Finite State Communication Protocols to High-Level Message Sequence Charts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 720-731, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
HMSC, bounded automata, partial order specification, specification, Message sequence charts |
18 | Albert Atserias |
Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 148-158, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Weak Pigeonhole Principle, Proof Complexity, Bounded Arithmetic |
18 | T. D. Alter, David W. Jacobs |
Uncertainty Propagation in Model-Based Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 27(2), pp. 127-159, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
scaled-orthographic, bounded error, Gaussian error, object recognition, linear programming, uncertainty, noise, alignment, error propagation, perspective, model-based vision |
18 | Aviezri S. Fraenkel, Ofer Rahat |
Infinite Cyclic Impartial Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computers and Games ![In: Computers and Games, First International Conference, CG'98, Tsukuba, Japan, November 11-12, 1998, Proceedings, pp. 212-221, 1998, Springer, 3-540-65766-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
infinite cyclic games, locally path-bounded digraphs, generalized Sprague-Grundy function |
18 | Bharath R. Modayur, Linda G. Shapiro |
PERFORM: A Fast Object Recognition Method Using Intersection of Projection Error Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 19(5), pp. 499-506, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
bounded error, uncertainty regions, parallel processing, Object recognition, algorithm complexity |
18 | Sam S. Appleton, Shannon V. Morton, Michael J. Liebelt |
Two-Phase Asynchronous Pipeline Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASYNC ![In: 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 7-10 April 1997, Eindhoven, The Netherlands, pp. 12-23, 1997, IEEE Computer Society, 0-8186-7922-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
two-phase asynchronous pipeline control, bounded-delay model, prototype microprocessor, microprocessor chips |
18 | Michael E. Saks |
Randomization and Derandomization in Space_Bounded Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 128-149, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
pseudorandom generators, Probabilistic computation, space-bounded computation |
18 | Ishfaq Ahmad, Yu-Kwong Kwok, Min-You Wu |
Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), June 12-14, 1996, Beijing, China, pp. 207-213, 1996, IEEE Computer Society, 0-8186-7460-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
edge-weighted directed acyclic graph, bounded number of processors scheduling, arbitrary processor network, scheduling, scheduling, parallel programming, processor scheduling, data flow graphs, task graphs, parallel processors, dataflow graph |
18 | Kathy Ryall, Stuart M. Shieber, Joe Marks, Murray Mazer |
Semi-automatic delineation of regions in floor plans. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume II, pp. 964-969, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
computer aided facilities layout, semi-automatic delineation, proximity field, proximity metric, scanned bitmap, building floor plan, semi-automated interactive system, area-filling techniques, areal regions, partially bounded regions, document image processing, operations research, engineering graphics |
18 | Albert Mo Kim Cheng, James C. Browne, Aloysius K. Mok, Rwo-Hsi Wang |
Analysis of Real-Time Rule-Based Systems with Bahavioral Constraint Assertions Specified in Estella. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 19(9), pp. 863-885, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
real-time rule-based systems, behavioral constraint assertions, Estella, knowledge-decision processing, human expertise, monitor-respond cycle, bounded response time, rule-based programmer, application-specific knowledge, real-time systems, formal specification, knowledge representation, expert systems, constraint handling, rule-based expert systems |
18 | Gilles Bernot, Pascale Le Gall |
Exception Handling and Term Labelling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'93: Theory and Practice of Software Development, International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993, Proceedings, pp. 421-436, 1993, Springer, 3-540-56610-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Key-words Algebraic specifications of abstract data types, Error and exception handling, Exception recovery, Bounded data structures, Structured specifications |
18 | Ganeshkumar Ganapathysaravanabavan, Tandy J. Warnow |
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 156-163, 2001, Springer, 3-540-42516-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Shi-Chun Tsai, Wen-Guey Tzeng, Kun-Yi Zhou |
Key establishment schemes against storage-bounded adversaries in wireless sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 8(3), pp. 1218-1222, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Zdenek Dvorák 0001, Daniel Král |
Algorithms for Classes of Graphs with Bounded Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers, pp. 17-32, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer |
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 15th International Conference, TACAS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 107-123, 2009, Springer, 978-3-642-00767-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Vilas Jagannath, Yun Young Lee, Brett Daniel, Darko Marinov |
Reducing the Costs of Bounded-Exhaustive Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FASE ![In: Fundamental Approaches to Software Engineering, 12th International Conference, FASE 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 171-185, 2009, Springer, 978-3-642-00592-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Rainer Gemulla, Wolfgang Lehner, Peter J. Haas |
Maintaining bounded-size sample synopses of evolving datasets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 17(2), pp. 173-202, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Database sampling, Reservoir sampling, Sample maintenance, Synopsis |
18 | Jonathan Backer, David G. Kirkpatrick |
A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 628-643, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Angsheng Li, Weilin Li, Yicheng Pan 0001, Linqing Tang |
Definable Filters in the Structure of Bounded Turing Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 116-124, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
The Travelling Salesman Problem in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 198-209, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Dejvuth Suwimonteerabuth, Javier Esparza, Stefan Schwoon |
Symbolic Context-Bounded Analysis of Multithreaded Java Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 15th International SPIN Workshop, Los Angeles, CA, USA, August 10-12, 2008, Proceedings, pp. 270-287, 2008, Springer, 978-3-540-85113-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Alain Finkel, Arnaud Sangnier |
Reversal-Bounded Counter Machines Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 323-334, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Rainer Gemulla, Wolfgang Lehner |
Sampling time-based sliding windows in bounded space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 379-392, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
data stream sampling, sliding window sampling, uniform sampling, stratified sampling |
18 | Carlo A. Furia, Matteo Rossi |
MTL with Bounded Variability: Decidability and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008. Proceedings, pp. 109-123, 2008, Springer, 978-3-540-85777-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Francesco Orabona, Joseph Keshet, Barbara Caputo |
The projectron: a bounded kernel-based Perceptron. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Fifth International Conference (ICML 2008), Helsinki, Finland, June 5-9, 2008, pp. 720-727, 2008, ACM, 978-1-60558-205-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Thomas Eiter, Wolfgang Faber 0001, Michael Fink 0001, Stefan Woltran |
Complexity results for answer set programming with bounded predicate arities and implications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 51(2-4), pp. 123-165, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68N17, 68Q17 |
18 | Arturo Zavala-Río, Víctor Santibáñez |
A Natural Saturating Extension of the PD-With-Desired-Gravity-Compensation Control Law for Robot Manipulators With Bounded Inputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Robotics ![In: IEEE Trans. Robotics 23(2), pp. 386-391, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Yantao Song, Scott M. Pike |
Eventually k-Bounded Wait-Free Distributed Daemons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: The 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2007, 25-28 June 2007, Edinburgh, UK, Proceedings, pp. 645-655, 2007, IEEE Computer Society, 0-7695-2855-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
self-stabilization, wait-freedom, daemons |
18 | Camillo J. Taylor, John R. Spletzer |
A bounded uncertainty approach to cooperative localization using relative bearing constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29 - November 2, 2007, Sheraton Hotel and Marina, San Diego, California, USA, pp. 2500-2506, 2007, IEEE, 978-1-4244-0912-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish |
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings, pp. 479-498, 2007, Springer, 3-540-70935-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Ulrich Schöpp |
Stratified Bounded Affine Logic for Logarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings, pp. 411-420, 2007, IEEE Computer Society, 0-7695-2908-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Qing Zhu, Shumin Fei, Tao Li 0011, Tianping Zhang |
Robust Neural Networks Control for Uncertain Systems with Time-Varying Delays and Sector Bounded Perturbations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2007, 4th International Symposium on Neural Networks, ISNN 2007, Nanjing, China, June 3-7, 2007, Proceedings, Part I, pp. 81-86, 2007, Springer, 978-3-540-72382-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | James Broberg, Panlop Zeephongsekul, Zahir Tari |
Approximating Bounded General Service Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 12th IEEE Symposium on Computers and Communications (ISCC 2007), July 1-4, Aveiro, Portugal, pp. 817-823, 2007, IEEE Computer Society, 978-1-4244-1520-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Stefan Funke, Sören Laue |
Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 272-283, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Andy Jinqing Yu, Gianfranco Ciardo, Gerald Lüttgen |
Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24 - April 1, 2007, Proceedings, pp. 648-663, 2007, Springer, 978-3-540-71208-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Wenhui Zhang |
Verification of ACTL Properties by Bounded Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCAST ![In: Computer Aided Systems Theory - EUROCAST 2007, 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 12-16, 2007, Revised Selected Papers, pp. 556-563, 2007, Springer, 978-3-540-75866-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Suchismita Roy, P. P. Chakrabarti 0001, Pallab Dasgupta |
Bounded Delay Timing Analysis Using Boolean Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 20th International Conference on VLSI Design (VLSI Design 2007), Sixth International Conference on Embedded Systems (ICES 2007), 6-10 January 2007, Bangalore, India, pp. 295-302, 2007, IEEE Computer Society, 0-7695-2762-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak Benaskeur |
A Q-decomposition and bounded RTDP approach to resource allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), Honolulu, Hawaii, USA, May 14-18, 2007, pp. 200, 2007, IFAAMAS, 978-81-904262-7-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Q-decomposition, marginal revenue, heuristic search |
18 | Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi |
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 5(9), pp. 1267-1282, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
connectivity, wireless ad hoc networks, topology control, energy consumption, spatial reuse |
18 | Yingshu Li, My T. Thai, Feng Wang 0002, Ding-Zhu Du |
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 5(10), pp. 1460-1470, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Wireless networks, routing protocols, network management, distributed applications, algorithm design and analysis |
18 | Rachid El Harti, Gábor Lukács |
Bounded and Unitary Elements in Pro-C*-algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 14(2), pp. 151-164, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 18A05, 46H05, 46J05, 46K05 |
18 | Wen Song, Rui Zang |
Bounded linear regularity of convex sets in Banach spaces and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(1), pp. 59-79, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 90C25, 90C31 |
18 | Ji-Chang Lo, Min-Long Lin |
Robust H∞ control for fuzzy systems with Frobenius norm-bounded uncertainties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Fuzzy Syst. ![In: IEEE Trans. Fuzzy Syst. 14(1), pp. 1-15, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Giovanni Di Crescenzo, Richard J. Lipton, Shabsi Walfish |
Perfectly Secure Password Protocols in the Bounded Retrieval Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings, pp. 225-244, 2006, Springer, 3-540-32731-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
Resource Allocation in Bounded Degree Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 64-75, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Danny Harnik, Moni Naor |
On Everlasting Security in the Hybrid Bounded Storage Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, pp. 192-203, 2006, Springer, 3-540-35907-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala |
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 238-253, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Yossi Azar, Nir Levy |
Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, pp. 5-16, 2006, Springer, 3-540-35753-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret |
Bounded Second-Order Unification Is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 400-414, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Erzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil |
P Colonies with a Bounded Number of Cells and Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Membrane Computing ![In: Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers, pp. 352-366, 2006, Springer, 3-540-69088-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Ishai Rabinovitz, Orna Grumberg |
Bounded Model Checking of Concurrent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings, pp. 82-97, 2005, Springer, 3-540-27231-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Oscar H. Ibarra, Sara Woodworth |
On Bounded Symport/Antiport P Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 11th International Workshop on DNA Computing, DNA11, London, ON, Canada, June 6-9, 2005. Revised Selected Papers., pp. 129-143, 2005, Springer, 3-540-34161-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Srikar Pasham, Wei-Ming Lin |
Efficient Task Scheduling with Duplication for Bounded Number of Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS (1) ![In: 11th International Conference on Parallel and Distributed Systems, ICPADS 2005, Fuduoka, Japan, July 20-22, 2005, pp. 543-549, 2005, IEEE Computer Society, 0-7695-2281-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Shaz Qadeer, Jakob Rehof |
Context-Bounded Model Checking of Concurrent Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, pp. 93-107, 2005, Springer, 3-540-25333-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #301 - #400 of 19615 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|