Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
13 | Evgeny Dantsin, Alexander Wolpert |
An Improved Upper Bound for SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, pp. 400-407, 2005, Springer, 3-540-26276-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS (2) ![In: 11th International Conference on Parallel and Distributed Systems, ICPADS 2005, Fuduoka, Japan, July 20-22, 2005, pp. 32-36, 2005, IEEE Computer Society, 0-7695-2281-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 26th IEEE Real-Time Systems Symposium (RTSS 2005), 6-8 December 2005, Miami, FL, USA, pp. 311-320, 2005, IEEE Computer Society, 0-7695-2490-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Masayoshi Nakamoto, Yuji Maejima, Takao Hinamoto |
Discrete optimization for error feedback network using lower bound estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (1) ![In: International Symposium on Circuits and Systems (ISCAS 2005), 23-26 May 2005, Kobe, Japan, pp. 508-511, 2005, IEEE, 0-7803-8834-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Weimin Ma, Guoqing Chen |
Approximation Bound for Fuzzy-Neural Networks with Bell Membership Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fuzzy Systems and Knowledge Discovery, Second International Conference, FSKD 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I, pp. 721-727, 2005, Springer, 3-540-28312-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICOIN ![In: Information Networking, Convergence in Broadband and Mobile Networking, International Conference, ICOIN 2005, Jeju Island, Korea, January 31- February 2, 2005, Proceedings, pp. 609-618, 2005, Springer, 3-540-24467-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 714-722, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 955-964, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 24(3), pp. 525-530, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(12), pp. 1569-1581, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Scan circuits, test application time, static test compaction |
13 | Hung-Yu Chien |
Efficient Time-Bound Hierarchical Key Assignment Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 16(10), pp. 1301-1304, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Josh Young, Illah R. Nourbakhsh |
Low Overhead Manipulation of Bound Book Pages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: Proceedings of the 2004 IEEE International Conference on Robotics and Automation, ICRA 2004, April 26 - May 1, 2004, New Orleans, LA, USA, pp. 4326-4331, 2004, IEEE. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Sheng-Wen Shih, Po-Shan Kao, Wei-Shin Guo |
An Error Bound of Relative Image Blur Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (4) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 100-103, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2004 Parallel Processing, 10th International Euro-Par Conference, Pisa, Italy, August 31-September 3, 2004, Proceedings, pp. 541-550, 2004, Springer, 3-540-22924-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Vu-Duc Ngo, Hae-Wook Choi, Sin-Chong Park |
An Expurgated Union Bound for Space-Time Code Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICT ![In: Telecommunications and Networking - ICT 2004, 11th International Conference on Telecommunications, Fortaleza, Brazil, August 1-6, 2004, Proceedings, pp. 156-162, 2004, Springer, 3-540-22571-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings, pp. 644-655, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Andreas Alexander Albrecht |
A Problem-Specific Convergence Bound for Simulated Annealing-Based Local Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pp. 405-414, 2004, Springer, 3-540-22057-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2004, 10th International Conference, CP 2004, Toronto, Canada, September 27 - October 1, 2004, Proceedings, pp. 527-541, 2004, Springer, 3-540-23241-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Michael Schmitt 0001 |
An Improved VC Dimension Bound for Sparse Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings, pp. 393-407, 2004, Springer, 3-540-22282-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, Second InternationalSymposium, ISPA 2004, Hong Kong, China, December 13-15, 2004, Proceedings, pp. 648-655, 2004, Springer, 3-540-24128-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Xuerong Feng, Z. Meng, Ivan Hal Sudborough |
Improved Upper Bound for Sorting by Short Swaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China, pp. 98-103, 2004, IEEE Computer Society, 0-7695-2135-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Marzena Kryszkiewicz |
Upper Bound on the Length of Generalized Disjunction-Free Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSDBM ![In: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 21-23 June 2004, Santorini Island, Greece, pp. 31-40, 2004, IEEE Computer Society, 0-7695-2146-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Vincent Conitzer, Tuomas Sandholm |
Communication complexity as a lower bound for learning in games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-first International Conference (ICML 2004), Banff, Alberta, Canada, July 4-8, 2004, 2004, ACM. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Viet Dung Dang, Nicholas R. Jennings |
Generating Coalition Structures with Finite Bound from the Optimal Guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 19-23 August 2004, New York, NY, USA, pp. 564-571, 2004, IEEE Computer Society, 1-58113-864-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Petr Somol, Pavel Pudil, Jirí Grim |
On Prediction Mechanisms in Fast Branch & Bound Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops, SSPR 2004 and SPR 2004, Lisbon, Portugal, August 18-20, 2004 Proceedings, pp. 716-724, 2004, Springer, 3-540-22570-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 122(1-4), pp. 43-58, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 4(3), pp. 296-314, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 35(4), pp. 301-318, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Meir Katchalski, Subhash Suri, Yunhong Zhou |
A Constant Bound for Geometric Permutations of Disjoint Unit Balls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 29(2), pp. 161-173, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Roberto Barrio |
A Unified Rounding Error Bound for Polynomial Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 19(4), pp. 385-399, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 15th Euromicro Conference on Real-Time Systems (ECRTS 2003), 2-4 July 2003, Porto, Portugal, Proceedings, pp. 141-150, 2003, IEEE Computer Society, 0-7695-1936-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks |
13 | Charanjit S. Jutla |
Lower Bound on Linear Authenticated Encryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 10th Annual International Workshop, SAC 2003, Ottawa, Canada, August 14-15, 2003, Revised Papers, pp. 348-360, 2003, Springer, 3-540-21370-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Jirí Sgall, Gerhard J. Woeginger |
A Lower Bound for Cake Cutting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 459-469, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Sven Schuierer |
A Lower Bound for Randomized Searching on m Rays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Science in Perspective ![In: Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, pp. 264-277, 2003, Springer, 3-540-00579-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Etsuji Tomita, Tomokazu Seki |
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMTCS ![In: Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings, pp. 278-289, 2003, Springer, 3-540-40505-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Isabel Dorta, Coromoto León, Casiano Rodríguez |
A comparison between MPI and OpenMP Branch-and-Bound Skeletons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HIPS ![In: Eighth International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS'03), April 22-22, 2003, Nice, France, pp. 66-, 2003, IEEE Computer Society, 0-7695-1880-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSRE ![In: 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 17-20 November 2003, Denver, CO, USA, pp. 237-245, 2003, IEEE Computer Society, 0-7695-2007-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2003 International Conference on Computer-Aided Design, ICCAD 2003, San Jose, CA, USA, November 9-13, 2003, pp. 778-785, 2003, IEEE Computer Society / ACM, 1-58113-762-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCGRID ![In: 3rd IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2003), 12-15 May 2003, Tokyo, Japan, pp. 156-163, 2003, IEEE Computer Society, 0-7695-1919-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Randi Moe |
GRIBB - Branch-and-Bound Methods on the Internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPAM ![In: Parallel Processing and Applied Mathematics, 5th International Conference, PPAM 2003, Czestochowa, Poland, September 7-10, 2003. Revised Papers, pp. 1020-1027, 2003, Springer, 3-540-21946-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Cecilia Ekelin, Jan Jonsson |
A Lower-Bound Algorithm for Load Balancing in Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 7th International Conference, OPODIS 2003 La Martinique, French West Indies, December 10-13, 2003 Revised Selected Papers, pp. 146-158, 2003, Springer, 3-540-22667-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Jordi Planes |
Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, pp. 991, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Leena Unnikrishnan, Scott D. Stoller, Yanhong A. Liu |
Optimized Live Heap Bound Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 4th International Conference, VMCAI 2003, New York, NY, USA, January 9-11, 2002, Proceedings, pp. 70-85, 2003, Springer, 3-540-00348-7. The full citation details ...](Pics/full.jpeg) |
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? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 34(4), pp. 389-412, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(5), pp. 505-516, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
13 | Sanjeeb Dash |
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 145-160, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBI ![In: Proceedings of the 2002 IEEE International Symposium on Biomedical Imaging, Ritz-Carlton Hotel, Washington, DC, USA, 7-10 June 2002, pp. 66-69, 2002, IEEE, 0-7803-7584-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
13 | Seth Pettie |
An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 155-, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
13 | Jan Johannsen, N. S. Narayanaswamy |
An Optimal Lower Bound for Resolution with 2-Conjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 387-398, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers, pp. 185-196, 2002, Springer, 3-540-40431-7. The full citation details ...](Pics/full.jpeg) |
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) ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA, pp. 159-168, 2002, ACM, 1-58113-507-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
13 | Philipp Woelfel |
A Lower Bound Technique for Restricted Branching Programs and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 431-442, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WORDS ![In: 7th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2002), 7-9 January 2002, San Diego, CA, USA, pp. 207-214, 2002, IEEE Computer Society, 0-7695-1576-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
13 | Cecilia Ekelin, Jan Jonsson |
A Lower-Bound Algorithm for Minimizing Network Communication in Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 31st International Conference on Parallel Processing (ICPP 2002), 20-23 August 2002, Vancouver, BC, Canada, pp. 343-351, 2002, IEEE Computer Society, 0-7695-1677-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QoS-IP ![In: Quality of Service in Multiservice IP Networks, International Workshop, QoS-IP 2001, Rome, Italy, January 2001, Proceedings, pp. 51-66, 2001, Springer, 3-540-41512-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
13 | Erik D. Demaine, Alejandro López-Ortiz |
A linear lower bound on index size for text retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 289-294, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
13 | Adrian Vetta |
Approximating the minimum strongly connected subgraph via a matching lower bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 417-426, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
13 | Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt |
A Separation Bound for Real Algebraic Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 254-265, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
13 | Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle |
A New Synchronous Lower Bound for Set Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001, Proceedings, pp. 136-150, 2001, Springer, 3-540-42605-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the Sixth IEEE Symposium on Computers and Communications (ISCC 2001), 3-5 July 2001, Hammamet, Tunisia, pp. 282-287, 2001, IEEE Computer Society, 0-7695-1177-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
13 | X. Huang |
Denoising Image Via Minimum Variance Bound Bayesian Estimator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2001 IEEE International Conference on Multimedia and Expo, ICME 2001, August 22-25, 2001, Tokyo, Japan, 2001, IEEE Computer Society, 0-7695-1198-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAPR ![In: Advances in Pattern Recognition - ICAPR 2001, Second International Conference Rio de Janeiro, Brazil, March 11-14, 2001, Proceedings, pp. 230-239, 2001, Springer, 3-540-41767-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (2) ![In: Proceedings of the 2001 International Symposium on Circuits and Systems, ISCAS 2001, Sydney, Australia, May 6-9, 2001, pp. 61-64, 2001, IEEE, 0-7803-6685-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
13 | Tong Zhang 0001 |
A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT/EuroCOLT ![In: Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings, pp. 427-443, 2001, Springer, 3-540-42343-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
13 | Tong Zhang 0001 |
A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT/EuroCOLT ![In: Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings, pp. 65-81, 2001, Springer, 3-540-42343-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
13 | Zheng Zhang 0003, Chew Lim Tan |
Recovery of Distorted Document Images from Bound Volumes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 6th International Conference on Document Analysis and Recognition (ICDAR 2001), 10-13 September 2001, Seattle, WA, USA, pp. 429-433, 2001, IEEE Computer Society, 0-7695-1263-1. The full citation details ...](Pics/full.jpeg) |
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'. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 49(9), pp. 1005, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(5), pp. 905-911, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers, pp. 167-175, 2000, Springer, 3-540-42306-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
13 | Paul Horton |
Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings, pp. 84-98, 2000, Springer, 3-540-67633-3. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings, pp. 277-292, 2000, Springer, 3-540-67633-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
13 | Beate Bollig |
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 222-231, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
13 | Dragan Jankovic, Wolfgang Günther 0001, Rolf Drechsler |
Lower Bound Sifting for MDDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 30th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2000, Portland, Oregon, USA, May 23-25, 2000, Proceedings, pp. 193-198, 2000, IEEE Computer Society, 0-7695-0692-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
13 | Nicolas Gisin, Stefan Wolf 0001 |
Linking Classical and Quantum Key Agreement: Is There "Bound Information"? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings, pp. 482-500, 2000, Springer, 3-540-67907-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 12(3), pp. 155-159, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 1999 Conference on Asia South Pacific Design Automation, Wanchai, Hong Kong, China, January 18-21, 1999, pp. 291-294, 1999, IEEE Computer Society, 0-7803-5012-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
13 | Cao An Wang, Bo-Ting Yang |
A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pp. 265-275, 1999, Springer, 3-540-66279-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
13 | Ambros Marzetta, Adrian Brüngger |
A Dynamic-Programming Bound for the Quadratic Assignment Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, pp. 339-348, 1999, Springer, 3-540-66200-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks ![In: IEEE Trans. Neural Networks 9(6), pp. 1344-1351, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 17(2), pp. 191-215, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
13 | Jianer Chen, Donald K. Friesen, Hao Zheng |
Tight Bound on Johnson's Algoritihm for Max-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 274-281, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
optimization, approximation algorithm, maximum satisfiability, performance ratio |
13 | Nabil Kahalé |
A Semidefinite Bound for Mixing Rates of Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 190-203, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
13 | Minjoong Rim, Rajiv Jain |
Lower-bound performance estimation for the high-level synthesis scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(4), pp. 451-458, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
13 | John H. Reif, James A. Storer |
A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(5), pp. 1013-1019, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 556-567, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
13 | C. Greg Plaxton, Torsten Suel |
A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 618-629, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
13 | Koji Okada, Kaoru Kurosawa |
Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28 - December 1, 1994, Proceedings, pp. 33-41, 1994, Springer, 3-540-59339-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
13 | Jonathan Eckstein |
Control strategies for parallel mixed integer branch and bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings Supercomputing '94, Washington, DC, USA, November 14-18, 1994, pp. 41-48, 1994, IEEE Computer Society, 0-8186-6605-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
13 | Iiro S. Honkala |
A Lower Bound on Binary Codes with Covering Radius One. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algebraic Coding ![In: Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings, pp. 34-37, 1993, Springer, 3-540-57843-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
13 | Manfred Kunde |
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 272-283, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, CSC '90, Sheraton Washington Hotel, Washington, DC, USA, February 20-22, 1990, pp. 56-62, 1990, ACM, 0-89791-348-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
13 | Rajiv Gupta 0001 |
A Fresh Look at Optimizing Array Bound Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation (PLDI), White Plains, New York, USA, June 20-22, 1990, pp. 272-282, 1990, ACM, 0-89791-364-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
13 | Paul Helman |
A common schema for dynamic programming and branch and bound algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 36(1), pp. 97-128, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
13 | Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro |
Time Bound for Broadcasting in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings, pp. 19-33, 1989, Springer, 3-540-52292-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
12 | Stein W. Wallace, Chanaka Edirisinghe 0002 |
Stochastic Programs with Recourse: Upper Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 3797-3801, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 18(7), pp. 781-790, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Sci. Res. Dev. ![In: Comput. Sci. Res. Dev. 23(3-4), pp. 211-215, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 24(3), pp. 418-433, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(1), pp. 123-136, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(4), pp. 583-592, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Availability constraint, Approximation algorithms, Error bound, Flow shop scheduling |