|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2348 occurrences of 1350 keywords
|
|
|
Results
Found 6434 publication records. Showing 6434 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
71 | Petko Faber |
A Theoretical Framework for Relaxation Processes in Pattern Recognition: Application to Robust Nonparametric Contour Generalization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 25(8), pp. 1021-1027, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
compatibility function, relaxation operator, significance measure, information theoretic model selection, Generalization, support function |
59 | Thành Nguyen 0001 |
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 207-218, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
ATSP, LP relaxation |
53 | Takahiko Horiuchi, Kazuo Toraichi, Kazuhiko Yamamoto, Hiromitsu Yamada |
Relaxation optimizing processes in extended probabilistic space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume I, pp. 266-269, 1995, IEEE Computer Society, 0-8186-7128-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
relaxation optimizing processes, extended probabilistic space, probability theoretic model, relaxation matching method, Dempster-Shafer, pattern recognition, image processing, probability, image recognition, iterative methods, incompleteness |
53 | Marcello Pelillo, Mario Refice |
Learning Compatibility Coefficients for Relaxation Labeling Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(9), pp. 933-945, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
compatibility coefficients, relaxation labeling processes, local ambiguities, global consistency, pattern recognition, pattern recognition, image processing, learning (artificial intelligence), artificial intelligence, probability, iterative methods, neural nets, nonlinear programming, numerical analysis, contextual information, real numbers, iterative procedures, training data, relaxation theory |
53 | Shengzhi Du, Zengqiang Chen 0001, Zhuzhi Yuan |
Evolutionary Pseudo-Relaxation Learning Algorithm for Bidirectional Associative Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(4), pp. 559-566, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pseudo-relaxation method, digital pattern, genetic algorithm, neural network, associative memory, noise immunity |
53 | Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih |
Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 30 - June 1, 2005, Proceedings, pp. 258-272, 2005, Springer, 3-540-26152-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Subgradient Algorithm, Lagrangean Relaxation, Arc-Consistency |
53 | Zdzislaw Jackiewicz, Bruno D. Welfert, Barbara Zubik-Kowal |
Spectral Versus Pseudospectral Solutions of the Wave Equation by Waveform Relaxation Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 20(1), pp. 1-28, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
spectral and pseudospectral methods, waveform relaxation iterations, spectra and pseudospectra, Wave equation |
53 | Toshiro Kubota, Terrance L. Huntsberger, Jeffrey T. Martin |
Edge Based Probabilistic Relaxation for Sub-pixel Contour Extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, Third International Workshop, EMMCVPR 2001, Sophia Antipolis, France, September 3-5, 2001, Proceedings, pp. 328-343, 2001, Springer, 3-540-42523-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
feature extraction, segmentation, relaxation labelling |
47 | Hongwei Liu 0001, Sanyang Liu, Fengmin Xu |
A Tight Semidefinite Relaxation of the MAX CUT Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(3), pp. 237-245, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
semidefinite relaxation, cut polytope, metric polytope, MAX CUT problem |
47 | Michael S. Hsiao, Srimat T. Chakradhar |
State Relaxation Based Subsequence Removal for Fast Static Compaction in Sequential Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 1998 Design, Automation and Test in Europe (DATE '98), February 23-26, 1998, Le Palais des Congrès de Paris, Paris, France, pp. 577-582, 1998, IEEE Computer Society, 0-8186-8359-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
test set compaction, state relaxation, recurrence subsequence removal, sequential circuit |
41 | Edwin R. Hancock, Josef Kittler |
Edge-Labeling Using Dictionary-Based Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(2), pp. 165-181, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
dictionary-based relaxation, edge labeling, edge structure, pattern recognition, pattern recognition, picture processing, picture processing, probability, pixel, probabilistic relaxation |
41 | Xinhua Zhuang, Robert M. Haralick, Hyonam Joo |
A Simplex-Like Algorithm for the Relaxation Labeling Process. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(12), pp. 1316-1321, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
simplex-like algorithm, relaxation labeling process, fast convergence property, one-more-step theorem, consistent-labeling search space, pattern recognition, linear programming, linear programming, variational inequality, convergence of numerical methods, relaxation theory |
41 | A. Touzani, Jack-Gérard Postaire |
Mode Detection by Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 10(6), pp. 970-978, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
multidimensional data clustering, relaxation process, label probabilities, mode detection, probability, computerised pattern recognition, iterative methods, probability density function, computerized pattern recognition, relaxation theory |
41 | Yevgeny Schreiber |
Cost-Driven Interactive CSP with Constraint Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings, pp. 707-722, 2009, Springer, 978-3-642-04243-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Cost-Driven Interactive CSP, ICSP, Functional Test Generation, Constraint Relaxation |
41 | Yong Wu, Yuanjun He, Haishan Tian |
Relaxation of spherical parameterization meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 21(11), pp. 897-904, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Spherical mesh, Distortion metric, Parameterization, Relaxation, Patch |
41 | Qing X. Wu |
A Correlation-Relaxation-Labeling Framework for Computing Optical Flow - Template Matching from a New Perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 17(9), pp. 843-853, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
cloud motion fields, motion estimation, Optical flow, template matching, cross-correlation, relaxation labeling, dynamic scene analysis |
40 | Zhiwei Mao, Xianmin Wang, Xiaofeng Wang |
Semidefinite programming relaxation approach for multiuser detection of QAM signals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 6(12), pp. 4275-4279, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Andreas Eisenblätter |
The Semidefinite Relaxation of the k -Partition Polytope Is Strong. ![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. 273-290, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Rika Ito, Tetsuya Fujie, Kenji Suyama, Ryuichi Hirabayashi |
New design methods of FIR filters with signed power of two coefficients based on a new linear programming relaxation with triangle inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (1) ![In: Proceedings of the 2002 International Symposium on Circuits and Systems, ISCAS 2002, Scottsdale, Arizona, USA, May 26-29, 2002, pp. 813-816, 2002, IEEE, 0-7803-7448-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Noboru Sonehara |
Binary representation and intensity surface interpolation of the grey level image by relaxation neural network models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, SPDP 1990, Dallas, Texas, USA, December 9-13, 1990., pp. 420-427, 1990, IEEE Computer Society, 0-8186-2087-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
37 | H. Joachim Schroll |
High Resolution Relaxed Upwind Schemes in Gas Dynamics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 17(1-4), pp. 599-607, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
relaxation approximation, upwind and relaxation schemes, high order reconstruction, conservation law |
37 | Shantanu Dutt, Halim Theny |
Partitioning around roadblocks: tackling constraints with intermediate relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 350-355, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
balance-ratio constraint, benefit estimation, blind relaxation, constraint-driven partitioning, estimate-driven relaxation, mincut partitioning, probabilistic gain, violating moves |
37 | B. John Oommen, Jack R. Zgierski |
Breaking Substitution Cyphers Using Stochastic Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(2), pp. 185-192, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
substitution cyphers, finite plaintext alphabet, cypher alphabet, unigrams, trigrams, automaton solution, cypher learning automaton, learning, cryptography, learning systems, cardinality, stochastic automata, stochastic automata, statistical information, relaxation theory, relaxation scheme |
37 | Richard Szeliski |
Fast Surface Interpolation Using Hierarchical Basis Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(6), pp. 513-528, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
hierarchical basis functions, multigrid relaxation, smoothing levels, picture processing, picture processing, interpolation, convergence, convergence of numerical methods, conjugate gradient, surface interpolation, relaxation theory |
37 | Christos Arvanitis |
Mesh Redistribution Strategies and Finite Element Schemes for Hyperbolic Conservation Laws. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 34(1), pp. 1-25, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Relaxation model, Adaptive mesh redistribution, Hyperbolic conservation laws, Finite element methods |
36 | Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi |
On the verification problem for weak memory models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010, pp. 7-18, 2010, ACM, 978-1-60558-479-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
lossy channel systems, program verification, infinite state systems, relaxed memory models |
35 | Ulf Brännlund |
Nondifferentiable Optimization: Relaxation Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2615-2618, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Lagrangian relaxation, Convex function, Subdifferential, Subgradient, Relaxation method, Bundle methods |
35 | Charles E. Leiserson, Satish Rao, Sivan Toledo |
Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 704-713, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
elliptic solver, blocking covers, sparse linear relaxation problems, primary memory, multigrid algorithm, iteration, out-of-core algorithms, numerical computation, linear relaxation |
34 | Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yokoo |
Adaptive price update in distributed Lagrangian relaxation protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS (2) ![In: 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 2, pp. 1033-1040, 2009, IFAAMAS, 978-0-9817381-7-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
distributed combinatorial optimization, generalized assignment, synchronization, spanning tree, Lagrangian relaxation, subgradient optimization |
34 | Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos |
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(4), pp. 46:1-46:21, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
ordinal embedding, Metrics, distortion, relaxation |
34 | Ernst Althaus, Stefan Canzar |
A Lagrangian relaxation approach for the multiple sequence alignment problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(2), pp. 127-154, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Branch and bound, Lagrangian relaxation, Sequence comparison |
34 | Zhen Liu, Na Li, Chaohai Zhang |
Unit Commitment Scheduling Using a Hybrid ANN and Lagrangian Relaxation Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MUE ![In: 2008 International Conference on Multimedia and Ubiquitous Engineering (MUE 2008), 24-26 April 2008, Busan, Korea, pp. 481-484, 2008, IEEE Computer Society, 978-0-7695-3134-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Lagrangian relaxation method, artificial neural networks, unit commitment |
34 | María Guijarro, Gonzalo Pajares, P. Javier Herrera |
On Combining Classifiers by Relaxation for Natural Textures in Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HAIS ![In: Hybrid Artificial Intelligence Systems, Third International Workshop, HAIS 2008, Burgos, Spain, September 24-26, 2008. Proceedings, pp. 345-352, 2008, Springer, 978-3-540-87655-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
image texture classification, fuzzy clustering, classifier, Relaxation, Bayesian |
34 | Steven D. Prestwich |
Exploiting relaxation in local search for LABS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 156(1), pp. 129-141, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Hybrid local search, Optimization, Relaxation, LABS |
34 | Augustus J. E. M. Janssen, J. S. H. van Leeuwaarden |
Relaxation Time for the Discrete D/G/1 Queue. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 50(1), pp. 53-80, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
D/G/1 queue, relaxation time, saddle point method, Spitzer’s identity, asymptotics |
34 | Wided Ouaja, Barry Richards |
Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 383-387, 2005, ACM, 1-58113-964-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
integer multicommodity flow problems, network routing, constraint propagation, lagrangian relaxation |
34 | Stefan Balev |
Solving the Protein Threading Problem by Lagrangian Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004, Proceedings, pp. 182-193, 2004, Springer, 3-540-23018-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
sequence-structure alignment, Lagrangian relaxation and duality, dynamic programming, integer programming, protein structure prediction, protein threading, subgradient optimization |
34 | Meinolf Sellmann, Torsten Fahle |
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 118(1-4), pp. 17-33, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximum weighted stable set constraint, knapsack constraint, Lagrangian relaxation, optimization constraint |
34 | 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 |
34 | Philippe Andrey, Philippe Tarroux |
Unsupervised Segmentation of Markov Random Field Modeled Textured Images Using Selectionist Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 20(3), pp. 252-262, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Markov/Gibbs random fields, partition function approximation, selectionist relaxation, genetic algorithms, Unsupervised texture segmentation |
34 | Neelam Gupta, Aditya P. Mathur, Mary Lou Soffa |
Automated Test Data Generation Using an Iterative Relaxation Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGSOFT FSE ![In: Proceedings of the ACM SIGSOFT International Symposium on Foundations of Software Engineering, SIGSOFT 1998, Lake Buena Vista, Florida, USA, November 3-5, 1998, pp. 231-244, 1998, ACM, 978-1-58113-108-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
dynamic test data generation, input dependency set, predicate residuals, predicate sliccs, path testing, relaxation methods |
34 | Ioannis Matalas, Ralph Benjamin, Richard Kitney |
An Edge Detection Technique Using the Facet Model and Parameterized Relaxation Labeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 19(4), pp. 328-341, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
facet model, curve enhancement, computer vision, Edge detection, image analysis, relaxation labeling |
34 | P. J. van der Houwen, W. A. van der Veen |
Waveform relaxation methods for implicit differential equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 7(1-2), pp. 183-197, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
implicit differential equations, waveform relaxation, parallelism, convergence, numerical analysis, Runge-Kutta methods |
34 | Takeshi Nagasaki, Takayoshi Yamamoto, Masaki Nakagawa |
The Behavior of Dynamic Relaxation in an Elastic Stroke Model for Character Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 4th International Conference Document Analysis and Recognition (ICDAR '97), 2-Volume Set, August 18-20, 1997, Ulm, Germany, Proceedings, pp. 16-22, 1997, IEEE Computer Society, 0-8186-7898-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Dynamic Relaxation, Elastic Stroke Model, Handwritten Character Pattern, Parallel DP, Off-line Recognition |
34 | Weian Deng, S. Sitharama Iyengar |
A New Probabilistic Relaxation Scheme and Its Application to Edge Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 18(4), pp. 432-437, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
dictionary scheme, edge detection, MRF, Probabilistic relaxation |
34 | Stephen G. Eick, Albert G. Greenberg, Boris D. Lubachevsky, Alan Weiss |
Synchronous Relaxation for Parallel Simulations with Applications to Circuit-Switched Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 3(4), pp. 287-314, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
parallel, fixed point, relaxation, discrete event |
34 | Pierre Parent, Steven W. Zucker |
Radial Projection: An Efficient Update Rule for Relaxation Labeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(8), pp. 886-889, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
radial projection, pattern recognition, pattern recognition, graph theory, picture processing, picture processing, graphs, convergence, iterative methods, contextual information, convergence of numerical methods, relaxation labeling, update rule |
34 | John Y. Hsiao, Alexander A. Sawchuk |
Supervised Textured Image Segmentation Using Feature Smoothing and Probabilistic Relaxation Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(12), pp. 1279-1292, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
nonstationary problem, variability reduction, feature smoothing, probabilistic relaxation techniques, supervised textured image segmentation, textured energy features, adaptive noise smoothing concept, quadrant filtering method, pattern recognition, pattern recognition, feature extraction, picture processing, picture processing, probability, efficiency, performance degradation, Bayes classifier |
34 | Sylvain Mouret, Ignacio E. Grossmann, Pierre Pestiaux |
Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 6th International Conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27-31, 2009, Proceedings, pp. 208-222, 2009, Springer, 978-3-642-01928-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Sumit Kumar Jha 0001, Bruce H. Krogh, James E. Weimer, Edmund M. Clarke |
Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 10th International Workshop, HSCC 2007, Pisa, Italy, April 3-5, 2007, Proceedings, pp. 287-300, 2007, Springer, 978-3-540-71492-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | C.-J. Richard Shi, Michael W. Tian, Guoyong Shi |
Efficient DC fault simulation of nonlinear analog circuits: one-step relaxation and adaptive simulation continuation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(7), pp. 1392-1400, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Dietmar Jannach, Johannes Liegl |
Conflict-Directed Relaxation of Constraints in Content-Based Recommender Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Advances in Applied Artificial Intelligence, 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2006, Annecy, France, June 27-30, 2006, Proceedings, pp. 819-829, 2006, Springer, 3-540-35453-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Dae-Sik Choi, In-Chan Choi |
On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem. ![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. 517-526, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Miguel F. Anjos |
An improved semidefinite programming relaxation for the satisfiability problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 102(3), pp. 589-608, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Satisfiability, Semidefinite programming, Discrete optimization |
34 | Chris H. Q. Ding, Xiaofeng He, Horst D. Simon |
Nonnegative Lagrangian Relaxation of K-Means and Spectral Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML ![In: Machine Learning: ECML 2005, 16th European Conference on Machine Learning, Porto, Portugal, October 3-7, 2005, Proceedings, pp. 530-538, 2005, Springer, 3-540-29243-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Aristide Mingozzi |
State Space Relaxation and Search Strategies in Dynamic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings, pp. 51, 2002, Springer, 3-540-43941-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Hiroyuki Hase, Toshiyuki Shinokawa, Masaaki Yoneda, Mitsuru Sakai, Hiroshi Maruyama |
Character String Extraction by Multi-stage Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 4th International Conference Document Analysis and Recognition (ICDAR '97), 2-Volume Set, August 18-20, 1997, Ulm, Germany, Proceedings, pp. 298-302, 1997, IEEE Computer Society, 0-8186-7898-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
34 | Kwan Hon Cheng, John D. Hazle, Edward Jackson, Roger Price, K. Kian Ang |
In-vivo Tissue Characterization of Brain by Synthetic MR Proton Relaxation and Statistical Chisquares Parameter Maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CBMS ![In: Eighth Annual IEEE Symposium on Computer-Based Medical Systems (CBMS'95), June 9-10, 1995, Lubbock, Texas, USA, pp. 338-345, 1995, IEEE Computer Society, 0-8186-7117-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
34 | Gih-Guang Hung, Yen-Cheng Wen, Kyle A. Gallivan, Resve A. Saleh |
Improving the performance of parallel relaxation-based circuit simulators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(11), pp. 1762-1774, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
34 | Donald J. Erdman, Donald J. Rose |
Newton waveform relaxation techniques for tightly coupled systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(5), pp. 598-606, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
34 | Resve A. Saleh, Jacob K. White 0001 |
Accelerating relaxation algorithms for circuit simulation using waveform-Newton and step-size refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(9), pp. 951-958, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
32 | Patrick Odent, Luc J. M. Claesen, Hugo De Man |
A combined waveform relaxation: waveform relaxation newton algorithm for efficient parallel circuit simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EURO-DAC ![In: European Design Automation Conference, EURO-DAC 1990, Glasgow, Scotland, UK, March 12-15, 1990, pp. 244-248, 1990, IEEE Computer Society, 0-8186-2024-2. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
31 | Alain Billionnet, Sourour Elloumi |
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 109(1), pp. 55-68, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Quadratic 0-1 optimization, Convex quadratic relaxation, Semidefinite positive relaxation, Experiments, Integer programming, Max-cut |
31 | Hai T. T. Nguyen, Hoang N. Luong, Chang Wook Ahn |
Entropy measurement-based estimation model for bayesian optimization algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 343-350, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
evaluation relaxation, entropy, bayesian optimization algorithm, efficiency enhancement |
31 | Surendra Byna, Jiayuan Meng, Anand Raghunathan, Srimat T. Chakradhar, Srihari Cadambi |
Best-effort semantic document search on GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GPGPU ![In: Proceedings of 3rd Workshop on General Purpose Processing on Graphics Processing Units, GPGPU 2010, Pittsburgh, Pennsylvania, USA, March 14, 2010, pp. 86-93, 2010, ACM, 978-1-60558-935-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
best-effort computing, dependency relaxation, supervised semantic indexing, GPGPU, CUDA, document search |
31 | Hai Huang 0003, Chengfei Liu, Xiaofang Zhou 0001 |
Computing Relaxed Answers on RDF Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISE ![In: Web Information Systems Engineering - WISE 2008, 9th International Conference, Auckland, New Zealand, September 1-3, 2008. Proceedings, pp. 163-175, 2008, Springer, 978-3-540-85480-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
RDF Database, RDF Query, Query Relaxation |
31 | Jonathan F. Bard, Hadi W. Purnomo |
Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 10(1), pp. 5-23, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Preference scheduling, Nurse rostering, Lagrangian relaxation, Cyclic scheduling, Bundle method |
31 | Iris Hui-Ru Jiang, Song-Ra Pan, Yao-Wen Chang, Jing-Yang Jou |
Reliable crosstalk-driven interconnect optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 11(1), pp. 88-103, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
post-layout optimization, VLSI, interconnect, lagrangian relaxation |
31 | Ted K. Ralphs, Matthew V. Galati |
Decomposition and Dynamic Cut Generation in Integer Linear Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(2), pp. 261-285, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Integer Programming, Lagrangian Relaxation, Branch and Cut, Decomposition Algorithms, Branch and Price, Dantzig-Wolfe Decomposition |
31 | Yangjun Chen, Dunren Che, Karl Aberer |
On the efficient evaluation of relaxed queries in biological databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, McLean, VA, USA, November 4-9, 2002, pp. 227-236, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
position trees, query optimization, automaton, query relaxation, biological databases |
31 | Maurice Herlihy, Jeannette M. Wing |
Specifying Graceful Degradation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(1), pp. 93-104, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
graceful degradation specification, relaxation lattice method, large class of programs, site crashes, timing anomalies, synchronization conflicts, formal specification, fault tolerant computing, network partitions, security breaches |
31 | Shlomo Ta'asan |
Multigrid method for stability problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 3(3), pp. 261-274, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
stability problems, Multigrid, relaxation methods |
30 | Robert Carr, R. Ravi 0001 |
A New Bound for the 2-Edge Connected Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 112-125, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
30 | Anmol Mathur, C. L. Liu 0001 |
Timing-driven placement for regular architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(6), pp. 597-608, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Michel X. Goemans, Leslie A. Hall |
The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown. ![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. 415-429, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
30 | Olive K. L. Woo, Antoinette M. Lee |
Case report: Therapeutic potential of Flourishing-Life-Of-Wish Virtual Reality Therapy on Relaxation (FLOW-VRT-Relaxation) - a novel personalized relaxation in palliative care. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Digit. Health ![In: Frontiers Digit. Health 5, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | John N. Hooker |
Integer Programming: Lagrangian Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 1667-1673, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Lagrangian dual, Integer programming, Branch and bound, Lagrangian relaxation, Lagrange multipliers |
28 | Patrick Bosc, Allel HadjAli, Olivier Pivert |
Incremental controlled relaxation of failing flexible queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Inf. Syst. ![In: J. Intell. Inf. Syst. 33(3), pp. 261-283, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Cooperative answers, Proximity relation, Fuzzy number, Flexible queries, Query relaxation |
28 | Suman Sarkar, Hong-Hsu Yen, Sudhir S. Dixit, Biswanath Mukherjee |
Hybrid wireless-optical broadband access network (WOBAN): network planning using Lagrangean relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(4), pp. 1094-1105, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
primal model (PM), wireless network, optical network, network planning, Lagrangean relaxation, broadband access, duality gap |
28 | Saman Eskandarzadeh, Reza Tavakkoli-Moghaddam, Amir Azaron |
An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(2), pp. 214-234, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Capacitated arc routing, Monotropic and integer programming, Nonlinear programming, Lagrangian relaxation |
28 | Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos |
Multiple phase neighborhood Search - GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(2), pp. 134-156, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
ENS, Lagrangean relaxation and subgradient optimization, TSP, Metaheuristics, GRASP |
28 | Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu, Hiroshi Sugimoto |
Algorithm 883: SparsePOP - A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 35(2), pp. 15:1-15:13, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Matlab software package, polynomial optimization problem, semidefinite programming relaxation, sums-of-squares optimization, Global optimization, sparsity |
28 | Jeffrey Heer, Maneesh Agrawala, Wesley Willett |
Generalized selection via interactive query relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the 2008 Conference on Human Factors in Computing Systems, CHI 2008, 2008, Florence, Italy, April 5-10, 2008, pp. 959-968, 2008, ACM, 978-1-60558-011-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
information visualization, annotation, selection, pointing, reference, query relaxation, input techniques |
28 | Stelios Neophytou, Maria K. Michael |
On the Relaxation of n-detect Test Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 26th IEEE VLSI Test Symposium (VTS 2008), April 27 - May 1, 2008, San Diego, California, USA, pp. 187-192, 2008, IEEE Computer Society, 978-0-7695-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
N-detect, test set relaxation |
28 | Rumen Andonov, Nicola Yanev, Noël Malod-Dognin |
An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings, pp. 162-173, 2008, Springer, 978-3-540-87360-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Protein structure alignment, contact map overlap, combinatorial optimization, integer programming, branch and bound, Lagrangian relaxation |
28 | David McSherry, David W. Aha |
Mixed-Initiative Relaxation of Constraints in Critiquing Dialogues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCBR ![In: Case-Based Reasoning Research and Development, 7th International Conference on Case-Based Reasoning, ICCBR 2007, Belfast, Northern Ireland, UK, August 13-16, 2007, Proceedings, pp. 107-121, 2007, Springer, 978-3-540-74138-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
recommender systems, case-based reasoning, explanation, Critiquing, mixed-initiative interaction, constraint relaxation |
28 | Xuan Zhou 0001, Julien Gaugaz, Wolf-Tilo Balke, Wolfgang Nejdl |
Query relaxation using malleable schemas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China, June 12-14, 2007, pp. 545-556, 2007, ACM, 978-1-59593-686-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
malleable schema, query relaxation |
28 | Ciya Liao, Thomas Chang |
Applying ranking SVM in query relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Amsterdam, The Netherlands, July 23-27, 2007, pp. 763-764, 2007, ACM, 978-1-59593-597-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
information retrieval, query relaxation, ranking SVM |
28 | Chiaki Sakama, Katsumi Inoue |
Negotiation by abduction and relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), Honolulu, Hawaii, USA, May 14-18, 2007, pp. 242, 2007, IFAAMAS, 978-81-904262-7-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
extended abduction, logic programming, negotiation, relaxation |
28 | Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo |
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 147(1), pp. 23-41, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Set covering problem, Lagrangean relaxation, Multi-objective combinatorial optimization |
28 | Umar Malik, Imad M. Jaimoukha, G. D. Halikias, S. K. Gungah |
On the gap between the quadratic integer programming problem and its semidefinite relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 107(3), pp. 505-515, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Quadratic integer programming, Semidefinite relaxation, Zonotopes, Linear matrix inequalities, Hyperplane arrangements |
28 | Chuan Lin 0002, Hai Zhou 0001, Chris C. N. Chu |
A revisit to floorplan optimization by Lagrangian relaxation. ![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. 164-171, 2006, ACM, 1-59593-389-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
floorplan, Lagrangian relaxation |
28 | Kumara Sastry, Cláudio F. Lima, David E. Goldberg |
Evaluation relaxation using substructural information and linear estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 419-426, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
evaluation relaxation, fitness surrogates, estimation of distribution algorithms, linear regression, speed-up, efficiency enhancement, extended compact genetic algorithms |
28 | Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos |
A Hybrid Genetic-GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 10(4), pp. 311-326, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
genetic algorithms, traveling salesman problem, metaheuristics, Lagrangean Relaxation, greedy randomized adaptive search procedure |
28 | Tomas Eric Nordlander, Derek H. Sleeman, Kenneth N. Brown |
Knowledge base reuse through constraint relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
K-CAP ![In: Proceedings of the 3rd International Conference on Knowledge Capture (K-CAP 2005), October 2-5, 2005, Banff, Alberta, Canada, pp. 59-66, 2005, ACM, 1-59593-163-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
knowledge base reuse, relaxation techniques, scheduling, constraint satisfaction problem |
28 | Alexandre Belloni, Andre L. Diniz Souto Lima, Maria Elvira Piñeiro Maceira, Claudia A. Sagastizábal |
Bundle Relaxation and Primal Recovery in Unit Commitment Problems. The Brazilian Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 120(1-4), pp. 21-44, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
power system operation, feasible dispatch, Lagrangian relaxation, unit commitment, augmented Lagrangian, bundle methods |
28 | Satoru Iwata 0001 |
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 36(4), pp. 331-341, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Combinatorial relaxation, Index of DAE, Matrix pencil, Strict equivalence transformation, Matching, Determinant |
28 | Laura Bahiense, Francisco Barahona, Oscar Porto |
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(3), pp. 259-282, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Steiner trees, Lagrangian relaxation |
28 | Seokjin Lee, D. F. Wong 0001 |
Timing-driven routing for FPGAs based on Lagrangian relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of 2002 International Symposium on Physical Design, ISPD 2002, Del Mar, CA, USA, April 7-10, 2002, pp. 176-181, 2002, ACM, 1-58113-460-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
timing-driven routing, FPGA, Lagrangian relaxation |
28 | Alf Kimms |
Maximizing the Net Present Value of a Project Under Resource Constraints Using a Lagrangian Relaxation Based Heuristic with Tight Upper Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 102(1-4), pp. 221-236, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
heuristics, Lagrangian relaxation, resource-constrained project scheduling, net present value |
Displaying result #1 - #100 of 6434 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|