|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3585 occurrences of 2121 keywords
|
|
|
Results
Found 21817 publication records. Showing 19949 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
108 | Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky |
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stat. Comput. ![In: Stat. Comput. 14(2), pp. 143-166, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
max-product, min-sum, max-plus, max-marginals, dynamic programming, integer programming, inference, graphical models, Viterbi algorithm, iterative decoding, MAP estimation |
101 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the Min-Max (Regret) Versions of Cut Problems. ![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. 789-798, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, s–t min cut, complexity, min cut, min-max |
98 | Bozidar Radunovic, Jean-Yves Le Boudec |
A unified framework for max-min and min-max fairness with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(5), pp. 1073-1083, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
system design, max-min fairness, mathematical programming/optimization, elastic traffic, best-effort traffic |
96 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 862-873, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas |
78 | Ivan Stojmenovic |
Detecting intersection of two convex polygons in parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the Sixteenth ACM Annual Conference on Computer Science, Atlanta, Georgia, USA, February 23-25, 1988, pp. 736, 1988, ACM, 0-89791-260-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
73 | Christopher J. Merz, Michael J. Pazzani, Andrea Pohoreckyj Danyluk |
Tuning Numeric Parameters to Troubleshoot a Telephone-Network Loop. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Expert ![In: IEEE Expert 11(1), pp. 44-49, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
71 | Hiroshi Sakai, Michinori Nakata |
On Possible Rules and Apriori Algorithm in Non-deterministic Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSCTC ![In: Rough Sets and Current Trends in Computing, 5th International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, Proceedings, pp. 264-273, 2006, Springer, 3-540-47693-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Possible rules, Min-Max strategy, Max-Max strategy, Rough sets, Apriori algorithm, Non-deterministic information |
68 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 428-438, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
min-max regret, approximation, shortest path, minimum spanning tree, min-max, fptas |
68 | Yuan Zou, William T. M. Dunsmuir |
Generalized Max/Median Filtering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (1) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 428-431, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
generalized max/median filtering, output distribution, independent inputs, regular max/median filtering, image details preservation, generalized multistage median filtering, Laplacian noise, image processing, statistical analysis, Gaussian noise, noise suppression |
63 | Tomás Werner |
A Linear Programming Approach to Max-Sum Problem: A Review. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(7), pp. 1165-1179, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
undirected graphical models, max-sum, max-plus, max-product, supermodular optimization, Markov random fields, constraint satisfaction, belief propagation, linear programming relaxation |
62 | Sanjeev Mahajan, Ramesh Hariharan |
Derandomizing Semidefinite Programming Based Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 162-169, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat |
62 | Yiping Cheng, Da-Zhong Zheng |
An Algorithm for Timing Verification of Systems Constrained by Min-max Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 17(1), pp. 99-129, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Min-max functions, Asynchronous systems, Timing verification, Max-plus algebra |
60 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà |
Encoding Max-CSP into Partial Max-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 22-23 May 2008, Dallas, Texas, USA, pp. 106-111, 2008, IEEE Computer Society, 978-0-7695-3155-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Minimal Support, Max-CSP, Partial Max-SAT, Encodings |
60 | Yiping Cheng, Da-Zhong Zheng |
Min-Max Inequalities and the Timing Verification Problem with Max and Linear Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 15(2), pp. 119-143, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max inequalities, min-max functions, timing analysis and verification, discrete event systems |
59 | Emilia Oikarinen, Matti Järvisalo |
Max-ASP: Maximum Satisfiability of Answer Set Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings, pp. 236-249, 2009, Springer, 978-3-642-04237-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
59 | Kazuo Iwama, Andrzej Lingas, Masaki Okita |
Max-Stretch Reduction for Tree Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(2), pp. 223-235, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Tree spanner, Maximum stretch, Graph augmentation, Time complexity |
59 | Kazuo Iwama, Andrzej Lingas, Masaki Okita |
Max-stretch Reduction for Tree Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 122-133, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
59 | Eran Halperin, Uri Zwick |
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 202-217, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
57 | Michael Lewin, Dror Livnat, Uri Zwick |
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. ![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. 67-82, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
56 | Yiping Cheng, Da-Zhong Zheng |
A Cycle Time Computing Algorithm and its Application in the Structural Analysis of Min-max Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 14(1), pp. 5-30, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
min-max functions, cycle time, max-plus algebra |
56 | José Fernández Ramos, Alfonso Gago Bohórquez |
Two Operand Binary Adders with Threshold Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 48(12), pp. 1324-1337, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
neural networks, logic design, computer arithmetic, Threshold logic, threshold gate, binary adders |
55 | James Aspnes, Hagit Attiya, Keren Censor |
Max registers, counters, and monotone circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 36-45, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
max registers, distributed computing, shared memory, counters, monotone circuits |
54 | Federico Heras, Javier Larrosa |
A Max-SAT Inference-Based Pre-processing for Max-Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings, pp. 139-152, 2008, Springer, 978-3-540-79718-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Max-clique, Inference, Max-SAT |
54 | Hassene Aissi |
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 4(4), pp. 347-350, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Min-max regret, Complexity, Combinatorial optimization, Approximation, Data association, Robustness analysis, Min-max |
54 | Yongzhen Zhuang, Lei Chen 0002 |
Max Regional Aggregate over Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 1295-1298, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
54 | Louise Leenen, Anbulagan, Thomas Meyer 0002, Aditya K. Ghose |
Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2007: Advances in Artificial Intelligence, 20th Australian Joint Conference on Artificial Intelligence, Gold Coast, Australia, December 2-6, 2007, Proceedings, pp. 202-212, 2007, Springer, 978-3-540-76926-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
54 | Michael Kaufmann 0001, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian |
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 832-841, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
54 | Kok-Kiong Yap, Vikram Srinivasan, Mehul Motani |
MAX: human-centric search of the physical world. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SenSys ![In: Proceedings of the 3rd International Conference on Embedded Networked Sensor Systems, SenSys 2005, San Diego, California, USA, November 2-4, 2005, pp. 166-179, 2005, ACM, 1-59593-054-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
human-centric, landmark based localization, physical world, search |
52 | Adi Avidor, Ido Berkovitch, Uri Zwick |
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers, pp. 27-40, 2005, Springer, 3-540-32207-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Xiaoguang Yang, Jianzhong Zhang 0001 |
Some inverse min-max network problems under weighted l1 and linfinity norms with bound constraints on changes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(2), pp. 123-135, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Inverse min-max network problem, Weighted l 1 norm, Weighted l? norm, Bound constraints, Polynomial time algorithms |
50 | Zhen Guo, Zhongfei Zhang, Eric P. Xing, Christos Faloutsos |
Enhanced max margin learning on multimodal data mining in a multimedia database. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, USA, August 12-15, 2007, pp. 340-349, 2007, ACM, 978-1-59593-609-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
max margin, multimodal data mining, image retrieval, image annotation |
50 | Yiwei Thomas Hou, Shivendra S. Panwar, Henry H.-Y. Tzeng |
On Generalized Max-Min Rate Allocation and Distributed Convergence Algorithm for Packet Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 15(5), pp. 401-416, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Max-min rate allocation, minimum rate, peak rate, centralized algorithm, distributed algorithm, convergence, flow control, packet networks |
50 | Takao Asano |
An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 2-14, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Approximation algorithm, LP-relaxation, MAX SAT |
50 | Bernd Heidergott, R. de Vries |
Towards a (Max, +) Control Theory for Public Transportation Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 11(4), pp. 371-398, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
(max,+) algebra, control, Transportation networks, gradient estimation |
48 | Kaviraj Chopra, Bo Zhai, David T. Blaauw, Dennis Sylvester |
A new statistical max operation for propagating skewness in statistical timing analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2006 International Conference on Computer-Aided Design, ICCAD 2006, San Jose, CA, USA, November 5-9, 2006, pp. 237-243, 2006, ACM, 1-59593-389-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
48 | Sriram V. Pemmaraju, Rajiv Raman 0001 |
Approximation Algorithms for the Max-coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1064-1075, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell |
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 146-154, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Dave A. D. Tompkins, Holger H. Hoos |
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 16th Conference of the Canadian Society for Computational Studies of Intelligence, AI 2003, Halifax, Canada, June 11-13, 2003, Proceedings, pp. 145-159, 2003, Springer, 3-540-40300-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
48 | Alexander A. Ageev, Refael Hassin, Maxim Sviridenko |
An approximation algorithm for MAX DICUT with given sizes of parts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 34-41, 2000, Springer, 3-540-67996-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
47 | Fadi A. Aloul, Arathi Ramani, Karem A. Sakallah, Igor L. Markov |
Solution and Optimization of Systems of Pseudo-Boolean Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(10), pp. 1415-1424, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Pseudo Boolean (PB), Max-ONE, Global Routing, Conjunctive Normal Form (CNF), Backtrack Search, Integer Linear Programming (ILP), Max-SAT, Boolean Satisfiability (SAT) |
47 | Stephan Olariu, Zhaofang Wen |
Optimal Parallel Initialization Algorithms for a Class of Priority Queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(4), pp. 423-429, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
parallel initialization algorithms, adaptive parallel algorithm, priority queue structure, n-element array, parallel construction algorithms, heap-like structures, double-endedpriority queues, min-max heaps, deeps, min-max-pair heaps, exclusive-read-exclusive-write parallel random-access machine, parallel algorithms, data structures, queueing theory, processors, computationalcomplexity |
46 | Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore |
On Self-stabilizing Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 76-89, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
min-max heap, Distributed algorithm, self-stabilization, search tree |
46 | Jon M. Kleinberg, Yuval Rabani, Éva Tardos |
Fairness in Routing and Load Balancing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 568-578, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
load balancing, Network routing, bandwidth allocation, maximum flow, max-min fairness, unsplittable flow |
45 | Ig-hoon Lee, Junho Shim, Sang-goo Lee |
A Snappy B+-Trees Index Reconstruction for Main-Memory Storage Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I, pp. 1036-1044, 2006, Springer, 3-540-34070-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Nathan R. Sturtevant |
A Comparison of Algorithms for Multi-player Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computers and Games ![In: Computers and Games, Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers, pp. 108-122, 2002, Springer, 3-540-20545-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Xiangyang Xue, Hangzai Luo, Jianping Fan 0001 |
Structured max-margin learning for multi-label image annotation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIVR ![In: Proceedings of the 9th ACM International Conference on Image and Video Retrieval, CIVR 2010, Xi'an, China, July 5-7, 2010, pp. 82-88, 2010, ACM, 978-1-4503-0117-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
structured max-margin learning, visual concept network, image classification |
44 | Baljeet Malhotra, Mario A. Nascimento, Ioanis Nikolaidis |
Better tree - better fruits: using dominating set trees for MAX queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMSN ![In: Proceedings of the 5th Workshop on Data Management for Sensor Networks, in conjunction with VLDB, DMSN 2008, Auckland, New Zealand, August 24, 2008, pp. 1-7, 2008, ACM, 978-1-60558-284-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
MAX query, aggregate query processing, sensor networks, dominating sets |
44 | Ryan O'Donnell, Yi Wu 0002 |
An optimal sdp algorithm for max-cut, and equally optimal long code tests. ![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. 335-344, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
semidefinite programming, hardness of approximation, max-cut |
44 | Donghui Zhang, Vassilis J. Tsotras |
Optimizing spatial Min/Max aggregations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 14(2), pp. 170-181, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Spatial aggregates, Min/Max, Indexing |
43 | Nikolay Rubanov |
An information theoretic framework to compute the MAX/MIN operations in parameterized statistical timing analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISQED ![In: 10th International Symposium on Quality of Electronic Design (ISQED 2009), 16-18 March 2009, San Jose, CA, USA, pp. 728-733, 2009, IEEE Computer Society, 978-1-4244-2952-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Kok-Kiong Yap, Vikram Srinivasan, Mehul Motani |
MAX: Wide area human-centric search of the physical world. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Sens. Networks ![In: ACM Trans. Sens. Networks 4(4), pp. 26:1-26:34, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Human-centric, landmark-based localization, physical world, search |
43 | Martin Fürer, Shiva Prasad Kasiviswanathan |
Exact Max 2-Sat: Easier and Faster. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (1) ![In: SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, pp. 272-283, 2007, Springer, 978-3-540-69506-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Venkatesan Guruswami, Subhash Khot |
Hardness of Max 3SAT with No Mixed Clauses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 154-162, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Michel X. Goemans, David P. Williamson |
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 443-452, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Mitsuo Motoki |
Random Instance Generation for MAX 3SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 502-508, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Harald Hempel, Gerd Wechsung |
The Operators min and max on the Polynomial Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 93-104, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
42 | Stephane Gaubert, Max Plus |
Methods and Applications of (MAX, +) Linear Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 261-282, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
40 | Pankaj K. Agarwal, Lars Arge, Jun Yang 0001, Ke Yi 0001 |
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 7-18, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
40 | Bozidar Radunovic, Jean-Yves Le Boudec |
Rate Performance Objectives of Multihop Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 3(4), pp. 334-349, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
max-min, utility fairness, wireless, System design, mathematical programming/optimization, best-effort |
40 | Yigal Bejerano, Seung-Jae Han, Li (Erran) Li |
Fairness and load balancing in wireless LANs using association control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, MOBICOM 2004, 2004, Philadelphia, PA, USA, September 26 - October 1, 2004, pp. 315-329, 2004, ACM, 1-58113-868-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, load balancing, IEEE 802.11, wireless local area networks (WLAN), max-min fairness |
39 | Yuzhong Zhang, Jianfeng Ren, Chengfei Wang |
Scheduling with Rejection to Minimize the Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 411-420, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
scheduling with rejection, worst case performance ratio, Approximation algorithm, dynamic programming |
39 | Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen |
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. ![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. 182-193, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
maximum constraint satisfaction, complexity, approximability |
39 | Jatindra Kumar Deka |
Reasoning about Extremal Properties of Events. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TIME ![In: 10th International Symposium on Temporal Representation and Reasoning / 4th International Conference on Temporal Logic (TIME-ICTL 2003), 8-10 July 2003, Cairns, Queensland, Australia, pp. 26-36, 2003, IEEE Computer Society, 0-7695-1912-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
39 | David P. Williamson |
Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 1, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
38 | Kamran Jamshaid, Paul A. S. Ward |
Gateway-assisted max-min rate allocation for wireless mesh networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSWiM ![In: Proceedings of the 12th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2009, Tenerife, Canary Islands, Spain, October 26-19, 2009, pp. 38-45, 2009, ACM, 978-1-60558-616-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
802.11 DCF, wireless mesh networks, max-min fairness |
38 | Teresa Alsinet, Felip Manyà, Jordi Planes |
An efficient solver for weighted Max-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 41(1), pp. 61-73, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Weighted Branch and bound, Data structures, Heuristics, Lower bound, Max-SAT |
38 | M. Borschbach, A. Exeler |
A Tabu history driven crossover operator design for memetic algorithm applied to Max-2SAT-problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 605-606, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Max-2SAT, tabu search, memetic algorithms |
38 | Ion Necoara, Bart De Schutter, Ton J. J. van den Boom, Hans Hellendoorn |
Stable Model Predictive Control for Constrained Max-Plus-Linear Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 17(3), pp. 329-354, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Max-plus-linear systems, Input-state constraints, Positively invariant sets, Stability, Discrete-event systems, Model predictive control |
38 | Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li |
On Inconsistent Clause-Subsets for Max-SAT Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings, pp. 225-240, 2007, Springer, 978-3-540-74969-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Unit Propagation, Inconsistent Subset, Max-SAT |
38 | A. B. Dieker, Marc Lelarge |
Tails for (max, plus) recursions under subexponentiality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 53(4), pp. 213-230, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
(Max, plus) recursion, Open queueing network, Stochastic event graph, Resequencing delay, Subexponential distribution |
38 | Dritan Nace, Nhat Linh Doan, Éric Gourdin, Bernard Liau |
Computing optimal max-min fair resource allocation for elastic flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 14(6), pp. 1272-1281, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
elastic flows, optimization, resource allocation, linear programming, max-min fairness |
38 | Josep Argelich, Felip Manyà |
Exact Max-SAT solvers for over-constrained problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 12(4-5), pp. 375-392, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Soft constraints, Solvers, Max-SAT |
38 | François Baccelli, Marc Lelarge, Serguei Foss |
Asymptotics of Subexponential Max Plus Networks: the Stochastic Event Graph Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 46(1-2), pp. 75-96, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
open queueing network, stochastic event graph, subexponential random variable, integrated tail, Veraverbeke's theorem, (max,plus)-network, tandem queue, heavy tail |
38 | Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners |
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(3), pp. 267-294, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
semidefiniteprogramming, Lovász -function, MAX-k-CUT, approximation algorithms, satisfiability, graph colouring |
38 | Teresa Alsinet, Felip Manyà, Jordi Planes |
A Max-SAT Solver with Lazy Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IBERAMIA ![In: Advances in Artificial Intelligence - IBERAMIA 2004, 9th Ibero-American Conference on AI, Puebla, Mexico, November 22-26, 2004, Proceedings, pp. 334-342, 2004, Springer, 3-540-23806-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
data structures, heuristics, lower bound, branch and bound, Max-SAT |
38 | Song Chong, Sangho Lee 0003, Sungho Kang |
A simple, scalable, and stable explicit rate allocation algorithm for MAX-MIN flow control with minimum rate guarantee. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 9(3), pp. 322-335, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
asymptotic decay rate, elastic traffic services, max-min flow rate, scalibility, stability |
38 | Roberto Tagliaferri, Antonio Eleuteri, M. Meneganti, Fabrizio Barone |
Fuzzy min-max neural networks: from classification to regression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 5(1), pp. 69-76, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Fuzzy min-max hyperboxes, Classification, Regression, Fuzzy neural networks |
38 | Xiao Long Huang, Brahim Bensaou |
On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 2nd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2001, October 4-5, 2001, Long Beach, CA, USA, pp. 221-231, 2001, ACM, 1-58113-428-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
per-link/per-flow fairness, scheduling, ad-hoc networks, distributed algorithms, admission control, max-min fairness |
38 | Mao-cheng Cai, Xiaotie Deng, Wenan Zang |
A Min-Max Theorem on Feedback Vertex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 73-86, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
bipartite tournament, totally dual integrality, min-max relation, AMS subject classification. 68Q25, approximation algorithm, 68R10, feedback vertex set |
37 | Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 |
Free Bits, PCPs and Non-Approximability - Towards Tight Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 422-431, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability |
37 | Angelos Tsoukalas, Panos Parpas, Berç Rustem |
A smoothing algorithm for finite min-max-min problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(1), pp. 49-62, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Bernardt Duvenhage |
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Afrigraph ![In: Proceedings of the 6th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa, Afrigraph 2009, Pretoria, South Africa, February 4-6, 2009, pp. 81-90, 2009, ACM, 978-1-60558-428-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
implicit kd-tree, spherical earth, line of sight |
37 | Telikepalli Kavitha, Julián Mestre |
Max-Coloring Paths: Tight Bounds and Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 87-96, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl |
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ![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. 698-710, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Marianne Akian, Stephane Gaubert, Asma Lakhoua |
Convergence analysis of the Max-Plus Finite Element Method for Solving Deterministic Optimal Control Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico, pp. 927-934, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima |
Maintaining the diversity of solutions by non-geometric binary crossover: a worst one-max solver competition case study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 1111-1112, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
binary crossover, diversity maintenance, non-geometric crossover, genetic algorithms |
37 | Deng Pan, Yuanyuan Yang 0001 |
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), Proceedings, 26-30 March 2007, Long Beach, California, USA, pp. 1-10, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Tomás Werner |
What is decreased by the max-sum arc consistency algorithm? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Fourth International Conference (ICML 2007), Corvallis, Oregon, USA, June 20-24, 2007, pp. 1007-1014, 2007, ACM, 978-1-59593-793-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Wlodzimierz Ogryczak, Tomasz Sliwinski |
On Direct Methods for Lexicographic Min-Max Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part III, pp. 802-811, 2006, Springer, 3-540-34075-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
37 | Mourad Ahmane, Laurent Truffet |
State Feedback Control via Positive Invariance for Max-plus Linear Systems using *-algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ETFA ![In: Proceedings of 11th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2006, September 20-22, 2006, Diplomat Hotel Prague, Czech Republic, pp. 217-224, 2006, IEEE, 0-7803-9758-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
37 | Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001 |
Approximating interval coloring and max-coloring in chordal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 10, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Graph coloring, chordal graphs, dynamic storage allocation, perfect graphs |
37 | Yasuhito Asano, Takao Nishizeki, Masashi Toyoda |
Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISE ![In: Web Information Systems Engineering - WISE 2005, 6th International Conference on Web Information Systems Engineering, New York, NY, USA, November 20-22, 2005, Proceedings, pp. 1-14, 2005, Springer, 3-540-30017-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Sriram V. Pemmaraju, Rajiv Raman 0001, Kasturi R. Varadarajan |
Buffer minimization using max-coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 562-571, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
37 | Maâmar El-Amine Hamri, Norbert Giambiasi, Claudia S. Frydman |
Simulation Semantics for Min-Max DEVS Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AIS ![In: Artificial Intelligence and Simulation, 13th International Conference on AI, Simulation, and Planning in High Autonomy Systems, AIS 2004, Jeju Island, Korea, October 4-6, 2004, Revised Selected Papers, pp. 699-708, 2004, Springer, 3-540-24476-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Kevin Smyth, Holger H. Hoos, Thomas Stützle |
Iterated Robust Tabu Search for MAX-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 16th Conference of the Canadian Society for Computational Studies of Intelligence, AI 2003, Halifax, Canada, June 11-13, 2003, Proceedings, pp. 129-144, 2003, Springer, 3-540-40300-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex |
Solving Max-SAT as Weighted CSP. ![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. 363-376, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Roelof K. Brouwer |
A Fuzzy Threshold Max-Product Unit, with Learning Algorithm, for Classification of Pattern Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SBRN ![In: 6th Brazilian Symposium on Neural Networks (SBRN 2000), 22-25 November 2000, Rio de Janiero, Brazil, pp. 208-212, 2000, IEEE Computer Society, 0-7695-0856-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
37 | Howard J. Karloff, Uri Zwick |
A 7/8-Approximation Algorithm for MAX 3SAT? ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 406-415, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
37 | Takao Ono, Tomio Hirata, Takao Asano |
An Approximation Algorithm for MAX 3-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, pp. 163-170, 1995, Springer, 3-540-60573-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
36 | Nir Halman, Mikhail Y. Kovalyov, Alain Quilliot |
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 21(2), pp. 235-246, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 19949 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|