Search results for "Bound"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
13	Evgeny Dantsin, Alexander Wolpert	An Improved Upper Bound for SAT.	SAT	2005	DBLP DOI BibTeX RDF
13	Hongchi Shi, Xiaoli Li 0012, Yi Shang, Dianfu Ma	Cramer-Rao Bound Analysis of Quantized RSSI Based Localization in Wireless Sensor Networks.	ICPADS (2)	2005	DBLP DOI BibTeX RDF
13	Paolo Valente, Giuseppe Lipari	An Upper Bound to the Lateness of Soft Real-Time Tasks Scheduled by EDF on Multiprocessors.	RTSS	2005	DBLP DOI BibTeX RDF
13	Masayoshi Nakamoto, Yuji Maejima, Takao Hinamoto	Discrete optimization for error feedback network using lower bound estimation.	ISCAS (1)	2005	DBLP DOI BibTeX RDF
13	Weimin Ma, Guoqing Chen	Approximation Bound for Fuzzy-Neural Networks with Bell Membership Function.	FSKD (1)	2005	DBLP DOI BibTeX RDF
13	Il-Hwan Kim, Kyung-Ho Sohn, Young Yong Kim, Keum Chan Whang	Modeling and Analysis of Impatient Packets with Hard Delay Bound in Contention Based Multi-access Environments for Real Time Communication.	ICOIN	2005	DBLP DOI BibTeX RDF
13	Eli Gafni, Rachid Guerraoui, Bastian Pochon	From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement.	STOC	2005	DBLP DOI BibTeX RDF	early decision, simulation, reduction, set agreement
13	Zhixiang Chen 0001, Bin Fu	A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm.	COCOON	2005	DBLP DOI BibTeX RDF
13	Michael E. Saks, Alex Samorodnitsky, Leonid Zosin	A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C20, 90C35, 90B10
13	Irith Pomeranz, Sudhakar M. Reddy	Static Test Compaction for Full-Scan Circuits Based on Combinational Test Sets and Nonscan Input Sequences and a Lower Bound on the Number of Tests.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	Scan circuits, test application time, static test compaction
13	Hung-Yu Chien	Efficient Time-Bound Hierarchical Key Assignment Scheme.	IEEE Trans. Knowl. Data Eng.	2004	DBLP DOI BibTeX RDF
13	Josh Young, Illah R. Nourbakhsh	Low Overhead Manipulation of Bound Book Pages.	ICRA	2004	DBLP DOI BibTeX RDF
13	Sheng-Wen Shih, Po-Shan Kao, Wei-Shin Guo	An Error Bound of Relative Image Blur Analysis.	ICPR (4)	2004	DBLP DOI BibTeX RDF
13	Peng-fei Chuang, Resit Sendag, David J. Lilja	Improving Data Cache Performance via Address Correlation: An Upper Bound Study.	Euro-Par	2004	DBLP DOI BibTeX RDF
13	Vu-Duc Ngo, Hae-Wook Choi, Sin-Chong Park	An Expurgated Union Bound for Space-Time Code Systems.	ICT	2004	DBLP DOI BibTeX RDF
13	Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks	A Lower Bound on the Competitive Ratio of Truthful Auctions.	STACS	2004	DBLP DOI BibTeX RDF
13	Andreas Alexander Albrecht	A Problem-Specific Convergence Bound for Simulated Annealing-Based Local Search.	ICCSA (3)	2004	DBLP DOI BibTeX RDF	Simulated Annealing, Markov Chains, Convergence, Local Search, Cooling Schedules
13	Jean-Francois Puget	Improved Bound Computation in Presence of Several Clique Constraints.	CP	2004	DBLP DOI BibTeX RDF
13	Michael Schmitt 0001	An Improved VC Dimension Bound for Sparse Polynomials.	COLT	2004	DBLP DOI BibTeX RDF
13	Adam K. L. Wong, Andrzej M. Goscinski	Scheduling of a Parallel Computation-Bound Application and Sequential Applications Executing Concurrently on a Cluster - A Case Study.	ISPA	2004	DBLP DOI BibTeX RDF
13	Xuerong Feng, Z. Meng, Ivan Hal Sudborough	Improved Upper Bound for Sorting by Short Swaps.	ISPAN	2004	DBLP DOI BibTeX RDF
13	Marzena Kryszkiewicz	Upper Bound on the Length of Generalized Disjunction-Free Patterns.	SSDBM	2004	DBLP DOI BibTeX RDF
13	Vincent Conitzer, Tuomas Sandholm	Communication complexity as a lower bound for learning in games.	ICML	2004	DBLP DOI BibTeX RDF
13	Viet Dung Dang, Nicholas R. Jennings	Generating Coalition Structures with Finite Bound from the Optimal Guarantees.	AAMAS	2004	DBLP DOI BibTeX RDF
13	Petr Somol, Pavel Pudil, Jirí Grim	On Prediction Mechanisms in Fast Branch & Bound Algorithms.	SSPR/SPR	2004	DBLP DOI BibTeX RDF	subset search, feature selection, dimensionality reduction, search tree, subset selection, optimal search
13	Stefano Benati	An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	competitive location models, random utility theory, heuristic concentration, data-correcting method, submodular functions
13	Micah Adler, Neil Immerman	An n! lower bound on formula size.	ACM Trans. Comput. Log.	2003	DBLP DOI BibTeX RDF	lower bounds, temporal logic, Descriptive complexity
13	Lars Engebretsen	An Explicit Lower Bound for TSP with Distances One and Two.	Algorithmica	2003	DBLP DOI BibTeX RDF
13	Meir Katchalski, Subhash Suri, Yunhong Zhou	A Constant Bound for Geometric Permutations of Disjoint Unit Balls.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
13	Roberto Barrio	A Unified Rounding Error Bound for Polynomial Evaluation.	Adv. Comput. Math.	2003	DBLP DOI BibTeX RDF	recurrence relations, polynomial evaluation, rounding errors
13	Tarek F. Abdelzaher, Vivek Sharma 0004	A Synthetic Utilization Bound for Aperiodic Tasks with Resource Requirements.	ECRTS	2003	DBLP DOI BibTeX RDF	Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks
13	Charanjit S. Jutla	Lower Bound on Linear Authenticated Encryption.	Selected Areas in Cryptography	2003	DBLP DOI BibTeX RDF
13	Jirí Sgall, Gerhard J. Woeginger	A Lower Bound for Cake Cutting.	ESA	2003	DBLP DOI BibTeX RDF
13	Sven Schuierer	A Lower Bound for Randomized Searching on m Rays.	Computer Science in Perspective	2003	DBLP DOI BibTeX RDF
13	Etsuji Tomita, Tomokazu Seki	An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique.	DMTCS	2003	DBLP DOI BibTeX RDF
13	Isabel Dorta, Coromoto León, Casiano Rodríguez	A comparison between MPI and OpenMP Branch-and-Bound Skeletons.	HIPS	2003	DBLP DOI BibTeX RDF
13	Peter G. Bishop, Robin E. Bloomfield	Using a Log-normal Failure Rate Distribution for Worst Case Bound Reliability Prediction.	ISSRE	2003	DBLP DOI BibTeX RDF
13	Alessandra Nardi, Haibo Zeng 0001, Joshua L. Garrett, Luca Daniel, Alberto L. Sangiovanni-Vincentelli	A Methodology for the Computation of an Upper Bound on Nose Current Spectrum of CMOS Switching Activity.	ICCAD	2003	DBLP DOI BibTeX RDF
13	Kento Aida, Wataru Natsume, Yoshiaki Futakata	Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm.	CCGRID	2003	DBLP DOI BibTeX RDF
13	Randi Moe	GRIBB - Branch-and-Bound Methods on the Internet.	PPAM	2003	DBLP DOI BibTeX RDF
13	Cecilia Ekelin, Jan Jonsson	A Lower-Bound Algorithm for Load Balancing in Real-Time Systems.	OPODIS	2003	DBLP DOI BibTeX RDF
13	Jordi Planes	Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT.	CP	2003	DBLP DOI BibTeX RDF
13	Leena Unnikrishnan, Scott D. Stoller, Yanhong A. Liu	Optimized Live Heap Bound Analysis.	VMCAI	2003	DBLP DOI BibTeX RDF
13	Nicolas Gisin, Renato Renner, Stefan Wolf 0001	Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?	Algorithmica	2002	DBLP DOI BibTeX RDF
13	Vasco M. Manquinho, João P. Marques Silva	Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2002	DBLP DOI BibTeX RDF
13	Sanjeeb Dash	An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs.	IPCO	2002	DBLP DOI BibTeX RDF
13	R. E. Oliphant	Shear-modulus resolution implications of the Cramer-Rao bound for vibration elastography in isotropic soft tissues.	ISBI	2002	DBLP DOI BibTeX RDF
13	Seth Pettie	An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree.	FOCS	2002	DBLP DOI BibTeX RDF
13	Jan Johannsen, N. S. Narayanaswamy	An Optimal Lower Bound for Resolution with 2-Conjunctions.	MFCS	2002	DBLP DOI BibTeX RDF
13	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
13	Rada Chirkova	The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views. (PDF / PS)	PODS	2002	DBLP DOI BibTeX RDF
13	Philipp Woelfel	A Lower Bound Technique for Restricted Branching Programs and Applications.	STACS	2002	DBLP DOI BibTeX RDF
13	Domenico Cotroneo, Massimo Ficco, Mauro Gargiulo, Stefano Russo 0001, Giorgio Ventre	Service Differentiation of Communication-bound Processes in a Real-Time Operating System.	WORDS	2002	DBLP DOI BibTeX RDF
13	Cecilia Ekelin, Jan Jonsson	A Lower-Bound Algorithm for Minimizing Network Communication in Real-Time Systems.	ICPP	2002	DBLP DOI BibTeX RDF
13	Marco Listanti, Fabio Ricciato, Stefano Salsano	An Upper Bound to the Loss Probability in the Multiplexing of Jittered Flows.	QoS-IP	2001	DBLP DOI BibTeX RDF
13	Erik D. Demaine, Alejandro López-Ortiz	A linear lower bound on index size for text retrieval.	SODA	2001	DBLP BibTeX RDF
13	Adrian Vetta	Approximating the minimum strongly connected subgraph via a matching lower bound.	SODA	2001	DBLP BibTeX RDF
13	Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt	A Separation Bound for Real Algebraic Expressions.	ESA	2001	DBLP DOI BibTeX RDF
13	Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle	A New Synchronous Lower Bound for Set Agreement.	DISC	2001	DBLP DOI BibTeX RDF
13	Peter Barta, Felician Németh, Róbert Szabó, József Bíró	End-to-End Delay Bound Calculation in Generalized Processor Sharing Networks.	ISCC	2001	DBLP DOI BibTeX RDF
13	X. Huang	Denoising Image Via Minimum Variance Bound Bayesian Estimator.	ICME	2001	DBLP DOI BibTeX RDF
13	Petr Somol, Pavel Pudil, Jirí Grim	Branch & Bound Algorithm with Partial Prediction for Use with Recursive and Non-recursive Criterion Forms.	ICAPR	2001	DBLP DOI BibTeX RDF	subset search, recursive criteria, feature selection, search tree, subset selection, optimal search
13	Holger Boche, Slawomir Stanczak	Lower bound on mean squared channel estimation error for multiuser receiver.	ISCAS (2)	2001	DBLP DOI BibTeX RDF
13	Tong Zhang 0001	A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in Learning.	COLT/EuroCOLT	2001	DBLP DOI BibTeX RDF
13	Tong Zhang 0001	A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning.	COLT/EuroCOLT	2001	DBLP DOI BibTeX RDF
13	Zheng Zhang 0003, Chew Lim Tan	Recovery of Distorted Document Images from Bound Volumes.	ICDAR	2001	DBLP DOI BibTeX RDF
13	Li Sheng 0001, Jie Wu 0001	A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	strongly connected digraphs, interconnection networks, Deadlock-free routing
13	Tao Jiang 0001, Ming Li 0001, Paul M. B. Vitányi	A lower bound on the average-case complexity of shellsort.	J. ACM	2000	DBLP DOI BibTeX RDF	shellsort, computational complexity, sorting, Kolmogorov complexity, average-case complexity
13	Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya	On Double Bound Graphs with Respect to Graph Operations.	JCDCG	2000	DBLP DOI BibTeX RDF
13	Paul Horton	Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment.	CPM	2000	DBLP DOI BibTeX RDF
13	Rolf Backofen	An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC).	CPM	2000	DBLP DOI BibTeX RDF
13	Beate Bollig	Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.	MFCS	2000	DBLP DOI BibTeX RDF
13	Dragan Jankovic, Wolfgang Günther 0001, Rolf Drechsler	Lower Bound Sifting for MDDs.	ISMVL	2000	DBLP DOI BibTeX RDF
13	Nicolas Gisin, Stefan Wolf 0001	Linking Classical and Quantum Key Agreement: Is There "Bound Information"?	CRYPTO	2000	DBLP DOI BibTeX RDF	intrinsic information, secret-key rate, quantum privacy amplification, purification, entanglement, Secret-key agreement
13	Carlo Blundo, Alfredo De Santis, Kaoru Kurosawa, Wakaha Ogata	On a Fallacious Bound for Authentication Codes.	J. Cryptol.	1999	DBLP DOI BibTeX RDF	Spoofing attack, Substitution, Authentication codes
13	Kai Zhang, Tsuyoshi Shinogi, Haruhiko Takase, Terumine Hayashi	A Method for Evaluating Upper Bound of Simultaneous Switching Gates Using Circuit Partition.	ASP-DAC	1999	DBLP DOI BibTeX RDF
13	Cao An Wang, Bo-Ting Yang	A Tight Bound for ß-SKeleton of Minimum Weight Triangulations.	WADS	1999	DBLP DOI BibTeX RDF
13	Ambros Marzetta, Adrian Brüngger	A Dynamic-Programming Bound for the Quadratic Assignment Problem.	COCOON	1999	DBLP DOI BibTeX RDF
13	María José Pérez-Ilzarbe	Convergence analysis of a discrete-time recurrent neural network to perform quadratic real optimization with bound constraints.	IEEE Trans. Neural Networks	1998	DBLP DOI BibTeX RDF
13	Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.	Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF
13	Jianer Chen, Donald K. Friesen, Hao Zheng	Tight Bound on Johnson's Algoritihm for Max-SAT.	CCC	1997	DBLP DOI BibTeX RDF	optimization, approximation algorithm, maximum satisfiability, performance ratio
13	Nabil Kahalé	A Semidefinite Bound for Mixing Rates of Markov Chains.	IPCO	1996	DBLP DOI BibTeX RDF
13	Minjoong Rim, Rajiv Jain	Lower-bound performance estimation for the high-level synthesis scheduling problem.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
13	John H. Reif, James A. Storer	A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions.	J. ACM	1994	DBLP DOI BibTeX RDF	3-dimensional Euclidean space, minimal movement problem, mover's problem, theory of real closed fields, robotics, shortest path, motion planning
13	Paola Bonizzoni	A Tight Lower Bound for Primitivity in k-Structures.	ICALP	1994	DBLP DOI BibTeX RDF
13	C. Greg Plaxton, Torsten Suel	A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks.	ICALP	1994	DBLP DOI BibTeX RDF
13	Koji Okada, Kaoru Kurosawa	Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes.	ASIACRYPT	1994	DBLP DOI BibTeX RDF
13	Jonathan Eckstein	Control strategies for parallel mixed integer branch and bound.	SC	1994	DBLP DOI BibTeX RDF
13	Iiro S. Honkala	A Lower Bound on Binary Codes with Covering Radius One.	Algebraic Coding	1993	DBLP DOI BibTeX RDF
13	Manfred Kunde	Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound.	ESA	1993	DBLP DOI BibTeX RDF
13	Joseph F. Pekny, Donald L. Miller	A Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems.	ACM Conference on Computer Science	1990	DBLP DOI BibTeX RDF
13	Rajiv Gupta 0001	A Fresh Look at Optimizing Array Bound Checking.	PLDI	1990	DBLP DOI BibTeX RDF
13	Paul Helman	A common schema for dynamic programming and branch and bound algorithms.	J. ACM	1989	DBLP DOI BibTeX RDF
13	Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro	Time Bound for Broadcasting in Bounded Degree Graphs.	WG	1989	DBLP DOI BibTeX RDF
12	Stein W. Wallace, Chanaka Edirisinghe 0002	Stochastic Programs with Recourse: Upper Bounds.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Upper bound, Stochastic programming
12	Chih-Min Lin, Chun-Fei Hsu, Chao-Ming Chung	RCMAC-based adaptive control design for brushless DC motors.	Neural Comput. Appl.	2009	DBLP DOI BibTeX RDF	Recurrent CMAC, Uniformly ultimately bound stability, Brushless DC motor, FPGA
12	Yuri Evtushenko, Mikhail Posypkin, Israel Sigal	A framework for parallel large-scale global optimization.	Comput. Sci. Res. Dev.	2009	DBLP DOI BibTeX RDF	Parallel global optimization, Nonlinear programming, knapsack problems, Heuristic methods, Branch-and-bound methods
12	François Bonnet 0001, Michel Raynal	Conditions for Set Agreement with an Application to Synchronous Systems.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	lower bound, efficiency, condition, synchronous system, agreement problem
12	Ahmed Ghoniem, Hanif D. Sherali	Complementary column generation and bounding approaches for set partitioning formulations.	Optim. Lett.	2009	DBLP DOI BibTeX RDF	Complementary column generation, Duality-based lower bound, One-dimensional bin packing, Vehicle assembly-routing, Column generation
12	Hatem Hadda	A (4/3)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints.	Optim. Lett.	2009	DBLP DOI BibTeX RDF	Availability constraint, Approximation algorithms, Error bound, Flow shop scheduling