Search results for "bounded"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Masato Notomi, Tadao Murata	Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	hierarchical reachability graph, bounded Petri nets, concurrent-software analysis, communication protocol software, hierarchically organized state space, deadlock state, successor states, software engineering, Petri nets, efficiency, tractability, markings, state explosion, multiprocessing programs, hierarchical systems, state-space methods, Ada programs
22	Mathias Barra	Bounded minimalisation and bounded counting in argument-bounded idc's.	Math. Struct. Comput. Sci.	2010	DBLP DOI BibTeX RDF
22	Muhammad Yasser, Agus Trisanto, Ayman Haggag, Jianming Lu, Hiroo Sekiya, Takashi Yahagi	An Adaptive Sliding Mode Control Using Simple Adaptive Control for A Class of SISO Nonlinear Systems with Bounded-Input Bounded-Output and Bounded Nonlinearity.	CDC	2006	DBLP DOI BibTeX RDF
22	Ziny Flikop	Bounded Input Bounded Predefined Control Bounded Output	CoRR	2004	DBLP BibTeX RDF
22	Gregory R. Wheeler	Rational Acceptance and Conjunctive/Disjunctive Absorption.	J. Log. Lang. Inf.	2006	DBLP DOI BibTeX RDF	rational acceptance, the lottery paradox, System P, bounded uncertain reasoning, probabilistic logic
22	Chamseddine Talhi, Nadia Tawbi, Mourad Debbabi	Execution monitoring enforcement for limited-memory systems.	PST	2006	DBLP DOI BibTeX RDF	bounded history automata, enforcement mechanisms, locally-testable properties, security policies, execution monitoring, edit automata
22	Hyunho Yang, Kiseon Kim	Delay Guaranteed Fair Queueing(DGFQ) in Multimedia Packet Networks.	MMNS	2003	DBLP DOI BibTeX RDF	Quality of Service (QoS), Multimedia Network, Fair Queueing, Bounded Delay
22	Dirk P. Kroese, Victor F. Nicola	Efficient simulation of a tandem Jackson network.	ACM Trans. Model. Comput. Simul.	2002	DBLP DOI BibTeX RDF	Bounded relative error, tandem Jackson network, importance sampling, orthogonal polynomials, rare event simulation, Markov additive processes
22	Arnold Beckmann	A Note on Universal Measures for Weak Implicit Computational Complexity.	LPAR	2002	DBLP DOI BibTeX RDF	Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic
22	Robert D. Rosebrugh, Richard J. Wood	Boundedness and Complete Distributivity.	Appl. Categorical Struct.	2001	DBLP DOI BibTeX RDF	bounded suprema, completely distributive, adjunction
22	Hongjun Zhu, Jianwen Su, Oscar H. Ibarra	Toward Spatial Joins for Polygons.	SSDBM	2000	DBLP DOI BibTeX RDF	I/O bounded polygon, trapezoid, polygon, spatial join
22	Mark R. Greenstreet	Real-Time Merging.	ASYNC	1999	DBLP DOI BibTeX RDF	bounded-time, receptive mixer, real-time, merging, arbitration, metastability
22	Piotr Berman, Marek Karpinski	On Some Tighter Inapproximability Results (Extended Abstract).	ICALP	1999	DBLP DOI BibTeX RDF	Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals
22	Suad Alagic, Jose Solorzano, David Gitchell	Orthogonal to the Java Imperative.	ECOOP	1998	DBLP DOI BibTeX RDF	F-bounded polymorphism, Java Virtual Machine, Declarative languages, orthogonal persistence
22	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
22	Olga Saukh, Robert Sauter, Pedro José Marrón	Time-Bounded and Space-Bounded Sensing in Wireless Sensor Networks.	DCOSS	2008	DBLP DOI BibTeX RDF
22	Slim Abdellatif, Guy Juanole	Improving the admissibility of flows with bounded arrivals and bounded delay requirements in rate-controlled packet networks.	EUROMICRO-SEAA	2005	DBLP DOI BibTeX RDF
21	Tanmoy Chakraborty 0001, Sanjeev Khanna	Nash Dynamics in Constant Player and Bounded Jump Congestion Games.	SAGT	2009	DBLP DOI BibTeX RDF
21	Alain Lambert, Dominique Gruyer, Bastien Vincke, Emmanuel Seignez	Consistent outdoor vehicle localization by bounded-error state estimation.	IROS	2009	DBLP DOI BibTeX RDF
21	Joël Ouaknine, Alexander Rabinovich, James Worrell 0001	Time-Bounded Verification.	CONCUR	2009	DBLP DOI BibTeX RDF
21	Wei Chen 0018, Wenhui Zhang	Bounded Model Checking of ACTL Formulae.	TASE	2009	DBLP DOI BibTeX RDF
21	Michael R. Fellows, Danny Hermelin, Frances A. Rosamond	Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.	IWPEC	2009	DBLP DOI BibTeX RDF
21	Natasha Alechina, Brian Logan 0001, Nguyen Hoang Nga, Abdur Rakib	Reasoning about Other Agents' Beliefs under Bounded Resources.	KRAMAS	2008	DBLP DOI BibTeX RDF
21	Serena Fritsch, Aline Senart, Douglas C. Schmidt, Siobhán Clarke	Time-bounded adaptation for automotive system software.	ICSE	2008	DBLP DOI BibTeX RDF	automotive software systems, taxonomy, dynamic adaptation
21	Sanjiv Kapoor, Mohammad Sarwat	Bounded-Diameter Minimum-Cost Graph Problems.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
21	Sven Schewe, Bernd Finkbeiner	Bounded Synthesis.	ATVA	2007	DBLP DOI BibTeX RDF
21	Rotem Oshman, Orna Grumberg	A New Approach to Bounded Model Checking for Branching Time Logics.	ATVA	2007	DBLP DOI BibTeX RDF
21	Yanyan Xu 0001, Wei Chen 0018, Liang Xu, Wenhui Zhang	Evaluation of SAT-based Bounded Model Checking of ACTL Properties.	TASE	2007	DBLP DOI BibTeX RDF
21	Joost-Pieter Katoen, Ivan S. Zapreev	Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability.	QEST	2006	DBLP DOI BibTeX RDF
21	Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella	Length-Bounded Cuts and Flows.	ICALP (1)	2006	DBLP DOI BibTeX RDF
21	Rida A. Bazzi, Yin Ding	Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients.	DISC	2006	DBLP DOI BibTeX RDF	Fault Tolerance, Replication, Atomic, Timestamps, Wait-Free, Byzantine
21	Iyad A. Kanj, Ljubomir Perkovic	Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks.	ALGOSENSORS	2006	DBLP DOI BibTeX RDF
21	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.	J. ACM	2005	DBLP DOI BibTeX RDF	(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
21	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca	New Graph Classes of Bounded Clique-Width.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
21	Feodor F. Dragan, Chenyu Yan	Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width.	ISAAC	2005	DBLP DOI BibTeX RDF
21	Héctor Cancela 0001, Gerardo Rubino, Bruno Tuffin	Bounded Relative Efficiency in Rare Event Simulation.	SAINT Workshops	2005	DBLP DOI BibTeX RDF
21	Witold Charatonik, Lilia Georgieva, Patrick Maier 0001	Bounded Model Checking of Pointer Programs.	CSL	2005	DBLP DOI BibTeX RDF
21	Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan	Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.	CCC	2005	DBLP DOI BibTeX RDF
21	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.	SODA	2004	DBLP BibTeX RDF
21	Sobeeh Almukhaizim, Petros Drineas, Yiorgos Makris	On Concurrent Error Detection with Bounded Latency in FSMs.	DATE	2004	DBLP DOI BibTeX RDF
21	Satoshi Matsumoto, Takayoshi Shoudai	Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries.	ALT	2004	DBLP DOI BibTeX RDF
21	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	The Bidimensional Theory of Bounded-Genus Graphs.	MFCS	2004	DBLP DOI BibTeX RDF
21	José Bacelar Almeida, Paulo Sérgio Almeida, Carlos Baquero	Bounded Version Vectors.	DISC	2004	DBLP DOI BibTeX RDF
21	Galina Pasko, Alexander A. Pasko, M. Ikeda, Tosiyasu L. Kunii	Advanced Metamorphosis Based on Bounded Space-time Blending.	MMM	2004	DBLP DOI BibTeX RDF
21	Piotr Berman, Marek Karpinski	Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION.	ICALP	2002	DBLP DOI BibTeX RDF
21	Stefan Dziembowski, Ueli M. Maurer	Tight security proofs for the bounded-storage model.	STOC	2002	DBLP DOI BibTeX RDF
21	Alexander Zelikovsky, Ion I. Mandoiu	Practical approximation algorithms for zero- and bounded-skew trees.	SODA	2001	DBLP BibTeX RDF
21	Keijo Heljanko, Ilkka Niemelä	Bounded LTL Model Checking with Stable Models.	LPNMR	2001	DBLP DOI BibTeX RDF
21	Keijo Heljanko	Bounded Reachability Checking with Process Semantics.	CONCUR	2001	DBLP DOI BibTeX RDF
21	Joan Bagaria	Bounded forcing axioms as principles of generic absoluteness.	Arch. Math. Log.	2000	DBLP DOI BibTeX RDF
21	János Csirik, Gerhard J. Woeginger	Resource Augmentation for Online Bounded Space Bin Packing.	ICALP	2000	DBLP DOI BibTeX RDF	asymptotic worst case ratio, approximation algorithm, Online algorithm, competitive analysis, bin packing, resource augmentation
21	Lev D. Beklemishev	Open Least Element Principle and Bounded Query Computation.	CSL	1999	DBLP DOI BibTeX RDF
21	Kyoung Jun Lee, Yong Sik Chang	Time-Bounded Negation Framework for Multi-Agent Coordination.	PRIMA	1998	DBLP DOI BibTeX RDF
21	Arvind Gupta, Naomi Nishimura	Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width.	STACS	1996	DBLP DOI BibTeX RDF
21	Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng	Resource Bounded Randomness and Weakly Complete Problems.	ISAAC	1994	DBLP DOI BibTeX RDF
21	Sunil Arya, Michiel H. M. Smid	Efficient Construction of a Bounded Degree Spanner with Low Weight.	ESA	1994	DBLP DOI BibTeX RDF
21	Ofer Amrani, Yair Be'ery, Alexander Vardy	Bounded-Distance Decoding of the Leech Lattice and the Golay Code.	Algebraic Coding	1993	DBLP DOI BibTeX RDF
21	Tirza Hirst, David Harel	On the Power of Bounded Concurrency II: The Pushdown Automata Level.	CAAP	1990	DBLP DOI BibTeX RDF
21	Edward P. F. Chan, Héctor J. Hernández	On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies.	PODS	1987	DBLP DOI BibTeX RDF
21	Isolde Adler, Mark Weyer	Tree-Width for First Order Formulae.	CSL	2009	DBLP DOI BibTeX RDF
21	Shude Zhou, Robert B. Heckendorn, Zengqi Sun	Detecting the epistatic structure of generalized embedded landscape.	Genet. Program. Evolvable Mach.	2008	DBLP DOI BibTeX RDF	Linkage detection, Generalized embedded landscape, Genetic algorithm, Fourier transform, Epistasis, Problem structure
21	Itai Benjamini, Oded Schramm, Asaf Shapira	Every minor-closed property of sparse graphs is testable.	STOC	2008	DBLP DOI BibTeX RDF	minor closed properties, graph algorithms, property testing
21	Wenhui Zhang	Model Checking with SAT-Based Characterization of ACTL Formulas.	ICFEM	2007	DBLP DOI BibTeX RDF
21	Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison	Satisfiability of a Spatial Logic with Tree Variables.	CSL	2007	DBLP DOI BibTeX RDF
21	Michiro Kondo, Mayuka F. Kawaguchi	Partially Ordered Set with Residuated t-norm.	ISMVL	2005	DBLP DOI BibTeX RDF
21	Erik D. Demaine, Mohammad Taghi Hajiaghayi	Equivalence of local treewidth and linear local treewidth and its algorithmic applications.	SODA	2004	DBLP BibTeX RDF
21	M. R. K. Krishna Rao	Input-Termination of Logic Programs.	LOPSTR	2004	DBLP DOI BibTeX RDF
21	Yuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang 0002	A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
21	Georg Gottlob, Nicola Leone, Francesco Scarcello	Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. (PDF / PS)	PODS	2001	DBLP DOI BibTeX RDF
21	Eli Gafni, Michael Merritt, Gadi Taubenfeld	The concurrency hierarchy, and algorithms for unbounded concurrency.	PODC	2001	DBLP DOI BibTeX RDF
21	Jason Cong, Songjie Xu	Performance-driven technology mapping for heterogeneous FPGAs.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
21	Shlomo Moran, Marc Snir, Udi Manber	Applications of Ramsey's Theorem to Decision Tree Complexity	J. ACM	1985	DBLP DOI BibTeX RDF
21	Franz-Josef Brandenburg	On the Height of Syntactical Graphs.	Theoretical Computer Science	1981	DBLP DOI BibTeX RDF
18	Yingshu Li, Chunyu Ai, Chinh T. Vu, Yi Pan 0001, Raheem A. Beyah	Delay-Bounded and Energy-Efficient Composite Event Monitoring in Heterogeneous Wireless Sensor Networks.	IEEE Trans. Parallel Distributed Syst.	2010	DBLP DOI BibTeX RDF	Composite event detection, wireless sensor networks, energy efficiency, bounded delay
18	Lucas C. Cordeiro, Bernd Fischer 0002, João Marques-Silva 0001	Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking.	ECBS	2010	DBLP DOI BibTeX RDF	Embedded Software Verification, Bounded Model Checking, Satisfiability Modulo Theories
18	Zhi Fang, Lejian Liao, Ruoyu Chen	Bounded Model Checking for Web Service Discovery and Composition.	SNPD	2010	DBLP DOI BibTeX RDF	Web Service Composition, Bounded Model Checking, Web Service Discovery
18	Elena Dubrova, Maxim Teslenko, Ming Liu	Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-Based Bounded Model Checking.	ISMVL	2010	DBLP DOI BibTeX RDF	multiple-valued network, SAT, bounded model checking, gene regulatory network, attractor
18	Vasant A. Ubhaya	Lipschitzian Operators in Best Approximation by Bounded or Continuous Functions.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Approximation problem, Minimum distance problem, Best estimate, Continuous selection operator, Lipschitzian selection operator, Uniform norm, Quasiconvex function, Isotone functions, Majorants and minorants, Selection, Convex function, Continuous function, Best approximation, Bounded function
18	Anil Maheshwari, Norbert Zeh	I/O-Efficient Algorithms for Graphs of Bounded Treewidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Algorithms, Graph algorithms, External memory algorithms, Bounded treewidth
18	Bart J. Janssen, Remco Duits	Linear Image Reconstruction by Sobolev Norms on the Bounded Domain.	Int. J. Comput. Vis.	2009	DBLP DOI BibTeX RDF	Generalized sampling, Bounded domain, Interpolation, Image reconstruction, Reconstruction, Scale space, Singular point, Sobolev space, Deep structure
18	Li-Xia Song	On Nilpotent Matrices over Bounded Distributive Lattice.	IITSI	2009	DBLP DOI BibTeX RDF	Bounded distributive lattice, Nilpotent matrices, Prime filter, Directed graph
18	Libor Barto, Marcin Kozik	Constraint Satisfaction Problems of Bounded Width.	FOCS	2009	DBLP DOI BibTeX RDF	bounded width, constraint satisfaction problem, local consistency
18	Shu-Heng Chen, Ren-Jie Zeng, Tina Yu	Analysis of micro-behavior and bounded rationality in double auction markets using co-evolutionary GP.	GEC Summit	2009	DBLP DOI BibTeX RDF	double-auction market, co-evolution, bounded-rationality
18	Dongkai Zhang, Wenli Feng, Jiqing Qiu, Meijuan Shang	Numerical Bounded Solutions of Fuzzy Volterra Integral Equations.	FSKD (6)	2009	DBLP DOI BibTeX RDF	Fuzzy Volterra integral equations, Bounded solutions, Fuzzy number
18	Lucas C. Cordeiro, Bernd Fischer 0002, João Marques-Silva 0001	SMT-Based Bounded Model Checking for Embedded ANSI-C Software.	ASE	2009	DBLP DOI BibTeX RDF	Embedded ANSI-C Software, Bounded Model Checking, Satisfiability Modulo Theories
18	Omid Shahmirzadi, Sergio Mena, André Schiper	Relaxed Atomic Broadcast: State-Machine Replication Using Bounded Memory.	SRDS	2009	DBLP DOI BibTeX RDF	relaxed atomic broadcast, bounded memory, State-Machine replication
18	Bin Fu, Zhixiang Chen 0001	Sublinear time width-bounded separators and their application to the protein side-chain packing problem.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Width-bounded separator, Random sampling, Sublinear time algorithm
18	Hamed Janzadeh, Ahmad Kardan	A Multi-Issue Negotiation Mechanism for Bounded Rational Negotiators.	ITNG	2008	DBLP DOI BibTeX RDF	Game Theory, Optimization Methods, Bounded Rationality, Multi-Issue Negotiation
18	Gennaro Cordasco, Vittorio Scarano, Arnold L. Rosenberg	Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	data structures for parallel systems, bounded-conflict parallel memory access, data structures, parallel architectures, parallel systems, data mapping, graph labeling, Parallel memory systems
18	Han Cai, Do Young Eun	Crossing over the bounded domain: from exponential to power-law inter-meeting time in manet.	MobiCom	2007	DBLP DOI BibTeX RDF	bounded domain, exponential vs. power-law, inter-meeting time distribution, time and space scaling, mobile ad-hoc network
18	Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi	Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions.	PODC	2007	DBLP DOI BibTeX RDF	information theoretic, fault tolerance, replication, atomic, bounded, wait-free, byzantine
18	Lukasz Kowalik, Maciej Kurowski	Oracles for bounded-length shortest paths in planar graphs.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	Bounded length, shortest path, planar graph, dynamic environment, oracle
18	F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang, Uriel G. Rothblum	One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Bounded-shape partition, Sum partition, Schur convex function, Optimal partition
18	Jochen Könemann, Asaf Levin, Amitabh Sinha	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.	Algorithmica	2005	DBLP DOI BibTeX RDF	Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation
18	Mirela Damian, Sriram V. Pemmaraju	Computing Optimal Diameter-Bounded Polygon Partitions.	Algorithmica	2004	DBLP DOI BibTeX RDF	Diameter-bounded, Approximation algorithm, Polygon decomposition
18	Hossein Hajiabolhassan, Xuding Zhu	Sparse H-Colourable Graphs of Bounded Maximum Degree.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Uniquely H-colourable graphs, Bounded maximum degree, Girth
18	Aarti Gupta, Malay K. Ganai, Chao Wang 0001, Zijiang Yang 0006, Pranav Ashar	Learning from BDDs in SAT-based bounded model checking.	DAC	2003	DBLP DOI BibTeX RDF	BDD learning, learning, SAT, BDDs, bounded model checking, boolean satisfiability, SAT solvers, property checking
18	Xiaohua Jia	A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks.	IEEE/ACM Trans. Netw.	1998	DBLP DOI BibTeX RDF	delay-bounded multicast, distributed routing algorithm, multimedia systems, multicast routing, real-time communications
18	Jason Cong, Andrew B. Kahng, Cheng-Kok Koh, Chung-Wen Albert Tsao	Bounded-skew clock and Steiner routing.	ACM Trans. Design Autom. Electr. Syst.	1998	DBLP DOI BibTeX RDF	(inter)connection, boundary merging and embedding, bounded-skew, interior merging and embedding, merging region, merging segment, pathlength delay, VLSI, low power, synchronization, Steiner tree, clock tree, Elmore delay, zero-skew
18	Lisa Cingiser DiPippo, Victor Fay Wolfe	Object-Based Semantic Real-Time Concurrency Control with Bounded Imprecision.	IEEE Trans. Knowl. Data Eng.	1997	DBLP DOI BibTeX RDF	Bounded imprecision, real-time object-oriented databases, semantic concurrency control