×

Found 192 Documents (Results 1–100)

100
MathJax

An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem. (English) Zbl 1468.90109

Evtushenko, Yury (ed.) et al., Optimization and applications. 9th international conference, OPTIMA 2018, Petrovac, Montenegro, October 1–5, 2018. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 974, 131-143 (2019).
MSC:  90C27
PDF BibTeX XML Cite
Full Text: DOI

On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. (English) Zbl 1433.68646

Proceedings of the 15th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2019, Potsdam, Germany, August 27–29, 2019. New York, NY: Association for Computing Machinery (ACM). 154-168 (2019).
MSC:  68W50 68T20 68W40
PDF BibTeX XML Cite
Full Text: DOI arXiv

Fast methods for the index tracking problem. (English) Zbl 1397.90411

Kliewer, Natalia (ed.) et al., Operations research proceedings 2017. Selected papers of the annual international conference of the German Operations Research Society (GOR), Freie Universiät Berlin, Germany, September 6–8, 2017. Cham: Springer (ISBN 978-3-319-89919-0/pbk; 978-3-319-89920-6/ebook). Operations Research Proceedings, 277-283 (2018).
PDF BibTeX XML Cite
Full Text: DOI

Local max-cut in smoothed polynomial time. (English) Zbl 1369.68226

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 429-437 (2017).
MSC:  68Q25 68T20 91A10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Improved approximation for two dimensional strip packing with polynomial bounded width. (English) Zbl 1427.68368

Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 409-420 (2017).
MSC:  68W25 90C27
PDF BibTeX XML Cite
Full Text: DOI arXiv

Constant-factor approximations for cycle cover problems. (English) Zbl 1385.90001

Kochetov, Yury (ed.) et al., Discrete optimization and operations research. 9th international conference, DOOR 2016, Vladivostok, Russia, September 19–23, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44913-5/pbk; 978-3-319-44914-2/ebook). Lecture Notes in Computer Science 9869, 93-104 (2016).
MSC:  90B06
PDF BibTeX XML Cite
Full Text: DOI

On the solution of the optimal prediction problem for the maximum of a time-homogeneous diffusion. (English. Russian original) Zbl 1307.60043

Russ. Math. Surv. 69, No. 3, 569-571 (2014); translation from Usp. Mat. Nauk 69, No. 3, 177-178 (2014).
PDF BibTeX XML Cite
Full Text: DOI

How to run Turing machines on encrypted data. (English) Zbl 1311.94082

Canetti, Ran (ed.) et al., Advances in cryptology – CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18–22, 2013. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-40083-4/pbk). Lecture Notes in Computer Science 8043, 536-553 (2013).
MSC:  94A60
PDF BibTeX XML Cite
Full Text: DOI

Optimizing linear functions with randomized search heuristics – the robustness of mutation. (English) Zbl 1245.68178

Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 420-431, electronic only (2012).
MSC:  68T20 68W20
PDF BibTeX XML Cite
Full Text: DOI

Exact algorithms for Kayles. (English) Zbl 1339.05251

Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 59-70 (2011).
PDF BibTeX XML Cite
Full Text: DOI Link

On probabilistic versus deterministic provers in the definition of proofs of knowledge. (English) Zbl 1343.94042

Goldreich, Oded (ed.), Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman. Berlin: Springer (ISBN 978-3-642-22669-4/pbk). Lecture Notes in Computer Science 6650, 114-123 (2011).
MSC:  94A60
PDF BibTeX XML Cite
Full Text: DOI Link

Partial Quicksort and Quickpartitionsort. (English) Zbl 1355.68071

Drmota, Michael (ed.) et al., Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’10), Vienna, Austria, June 28 – July 2, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 505-512 (2010).
MSC:  68P10 68Q87 68W40
PDF BibTeX XML Cite
Full Text: Link

The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching. (English. Russian original) Zbl 1231.90326

Autom. Remote Control 70, No. 11, 1901-1912 (2009); translation from Avtom. Telemekh. 2009, No. 11, 148-160 (2009).
MSC:  90C27 05C35
PDF BibTeX XML Cite
Full Text: DOI

Nonlinear optimization over a weighted independence system. (English) Zbl 1246.90143

Goldberg, Andrew V. (ed.) et al., Algorithmic aspects in information and management. 5th international conference, AAIM 2009, San Francisco, CA, USA, June 15–17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02157-2/pbk). Lecture Notes in Computer Science 5564, 251-264 (2009).
MSC:  90C30 68Q25
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Reconstruction of partial orders and list representation as random structures. (English) Zbl 1336.68027

Seda, Anthony (ed.) et al., Proceedings of the Irish conference on the mathematical foundations of computer science and information technology (MFCSIT 2006), National University of Ireland, Cork, Ireland, August 1–5, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 225, 441-456 (2009).
PDF BibTeX XML Cite
Full Text: DOI

Linear logical algorithms. (English) Zbl 1155.68349

Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7–11, 2008. Proceedings, Part II. Berlin: Springer (ISBN 978-3-540-70582-6/pbk). Lecture Notes in Computer Science 5126, 336-347 (2008).
PDF BibTeX XML Cite
Full Text: DOI Link

On some straight string search algorithms. (English) Zbl 1121.68470

Trîmbiţaş, Radu T. (ed.), Proceedings of the international symposium on numerical analysis and approximation theory, Cluj-Napoca, Romania, May 9–11, 2002. Dedicated to the 75th anniversary of Professor Dr. Dimitrie D. Stancu, honorary member of the Romanian Academy. Cluj-Napoca: Cluj University Press (ISBN 973-610-166-5/pbk). 177-186 (2002).
MSC:  68W40 68W05
PDF BibTeX XML Cite

Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (English) Zbl 1184.68272

Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12–15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 272-276 (2001).
MSC:  68Q25 05A05 68W40
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software