Logowanie

Języki

  • Polski
  • English

publikacje w roku  

2012

  1. P. Keller, S. Lewanowicz, P. Woźny, Polynomial approximation of rational Bezier curves with constraints, Numerical Algorithms 59 (2012), 607-622. (http://dx.doi.org/10.1007/s11075-011-9507-0)
  2. P. Keller, A practical algorithm for computing Cauchy principal value integrals of oscillatory functions, Applied Mathematics and Computation 218 (2012), 4988-5001. (http://dx.doi.org/10.1016/j.amc.2011.10.064)
  3. J. Otop, E-unification with Constants vs. General E-unification, Journal of Automated Reasoning, Vol. 48 No. 3 (2012), 363-390. (http://dx.doi.org/10.1007/s10817-010-9201-2)
  4. P. Woźny, Simple algorithms for computing the Bezier coefficients of the constrained dual Bernstein polynomials, Applied Mathematics and Computation 219 (2012), 2521-2525. (http://dx.doi.org/10.1016/j.amc.2012.08.087 )
  5. C. Dürr, Ł. Jeż, N. K. Thang, Online scheduling of bounded length jobs to maximize throughput, Journal of Scheduling October 2012, Volume 15, Issue 5, pp 653-664 (http://dx.doi.org/10.1007/s10951-011-0233-1)
  6. Ł. Jeż, F. Li, J. Sethuraman, C. Stein, Online scheduling of packets with agreeable deadlines, Journal ACM Transactions on Algorithms (TALG) Volume 9 Issue 1, December 2012 Article No. 5, ACM New York, NY, USA (http://doi.acm.org/10.1145/2390176.2390181)
  7. L. Epstein, Ł. Jeż, J. Sgall, R. van Stee, Online Scheduling of Jobs with Fixed Start Times on Related Machines, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Lecture Notes in Computer Science Volume 7408, 2012, pp 134-145 (http://dx.doi.org/10.1007/978-3-642-32512-0_12)
  8. P. Gawrychowski, Tying up the loose ends in fully LZW-compressed pattern matching, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) / Christoph Dürr, Thomas Wilke (eds). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol. 14 ).- S. 624- 635. (http://dx.doi.org/10.4230/LIPIcs.STACS.2012.624)
  9. J. Michaliszyn, J. Otop, Decidable elementary modal logics, 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 25-28 June 2012, Dubrovnik, Croatia : proceedings /Rajeev Alur (ed.). - Los Alamitos : IEEE Computer Society, 2012.- S. 491-500. (http://dx.doi.org/10.1109/LICS.2012.59)
  10. K. Paluch, K. Elbassioni, A. van Zuylen, Simpler approximation of the maximum asymmetric traveling salesman problem, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) / Christoph Dürr, Thomas Wilke (eds). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; 14).- S. 501-506. (http://dx.doi.org/10.4230/LIPIcs.STACS.2012.501)
  11. M. Bieńkowski, T. Jurdziński, M. Korzeniowski, D. R. Kowalski, Distributed Online and Stochastic Queuing on a Multiple Access Channel, 26 Int. Symposum on DIStributed Computing (DISC), Lecture Notes in Computer Science vol. 7611, 121-135, 2012. (http://www.ii.uni.wroc.pl/~mbi/papers/2012-disc-online-mac.pdf)
  12. D. Biernacki, S. Lenglet, Applicative bisimulations for delimited-control operators, Foundations of software science and computational structures : 15th international conference FOSSACS 2012, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012 : proceedings / Lars Birkedal (ed.). - Berlin ; Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7213).- S. 119-134. (http://dx.doi.org/10.1007/978-3-642-28729-9)
  13. A. Jeż, Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P), 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) / Christoph Dürr, Thomas Wilke (eds). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.14). - S. 136- 147. (http://dx.doi.org/10.4230/LIPIcs.STACS.2012.136)
  14. E. Kieroński, J. Michaliszyn, I. Pratt-Hartmann, L. Tendera, Two-variable first-order logic with equivalence closure, Proceedings of the 27th Annual ACM/IEEE Symposium on Logic in Computer Science ; 25-28 June 2012, Dubrovnik, Croatia. - Los Alamitos : IEEE Computer Society, 2012.- S. 431-440. (http://dx.doi.org/10.1109/LICS.2012.53)
  15. R. Nowak, A method of convergence acceleration of some continued fractions II, Numerical Algorithms, 64(4), 2013. (http://link.springer.com/article/10.1007/s11075-012-9642-2)
  16. P. Wnuk-Lipiński, Parallel evolutionary algorithms for stock market trading rule selection on many-core graphics processors, Natural computing in computational finance. Vol. 4 / Anthony Brabazon, Michael O'Neill and Dietmar Maringer (Eds.). - Berlin, Heidelberg : Springer, 2012.- (Studies in Computational Intelligence ; 380).- S. 79-92. (http://dx.doi.org/10.1007/978-3-642-23336-4_5)
  17. Z. Płoski, Złożoność obliczeniowa, Christos H. Papadomitriou; z ang. przeł.: Zdzisław Płoski. - Nowe wyd. pol. - Gliwice : Wydaw. Helion, 2012. - 466 s.
  18. A. Bartkowiak, R. Zimroz, Curvilinear dimensionality reduction of data for gearbox condition monitoring, Przeglad Elektrotechniczny . - R. 88, nr 10b (2012), s. 268-271. (http://pe.org.pl/issue.php?lang=0)
  19. A. Bartkowiak, R. Zimroz, Data dimension reduction and visualization with application to multi-dimensional gearbox diagnostics data: comparison of several methods, Solid State Phenomena. - Vol. 180 (2012), s. 177-184. (http://www.dx.doi.org/10.4028/www.scientific.net/SSP.180.177)
  20. A. Bartkowiak, R. Zimroz, Curvilinear component analysis in search of dimensionality and structure of some gearbox data, Proceedings of the Federated Conference on Computer Science and Information Systems - FedCSIS 2012, September 9 - 12, 2012, Wroclaw, Poland / M. Ganzha, L. Maciaszek, M. Paprzycki, (eds). - Warszawa : Polskie Towarzystwo Informatyczne, 2012.- S. 27-34. (http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6330483)
  21. J. Byrka, K. Buchin, M. Buchin, M. Nöllenburg, Y. Okamoto, R. I. Silveira, Drawing (complete) binary tanglegrams : hardness, approximation, fixed-parameter tractability, Algorithmica. - Vol. 62, nr 1-2 (2012), s. 309-332. (http://dx.doi.org/10.1007/s00453-010-9456-3)
  22. P. Gawrychowski, Faster algorithm for computing the edit distance between SLP-compressed strings, String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012, Proceedings / Liliana Calderón- Benavides, Cristina González-Caro, Edgar Chávez,Nivio Ziviani (eds.). - Berlin : Springer Berlin , 2012. - (Lecture Notes in Computer Science ; 7608).- S. 229-236. (http://dx.doi.org/10.1007/978-3-642-34109-024)
  23. P. Gawrychowski, T. Gagie, J. Karkkainen, Y. Nekrich, S. J. Puglisi, A faster grammar-based self-index, Language and Automata Theory and Applications : 6th International Conference, LATA 2012, A Coruna, Spain, March 5-9, 2012 : proceedings / Adrian-Horia Dediu, Carlos Martín-Vide (eds.). - Berlin : Springer, 2012. - (Lecture Notes in Computer Science ; 7183).- S. 240-251. (http://dx.doi.org/10.1007/978-3-642-28332-121)
  24. P. Gawrychowski, Simple and efficient LZW-compressed multiple pattern matching, Combinatorial pattern matching : 23rd annual symposium ; proceedings / CPM 2012, Helsinki, Finland, July 3 - 5, 2012 / Juha Karkkainen, Jens Stoye (eds.). - Berlin ; Heidelberg : Springer , 2012. - (Lecture Notes in Computer Science ; 7354).- S. 232-242. (http://dx.doi.org/10.1007/978-3-642-31265-619)
  25. L. Grocholski, Specyfikowanie wymagań jako bariera wdrażania systemów klasy B2B, Metody Informatyki Stosowanej. - 2011, nr 5 (2012), s. 35-48.
  26. A. Jeż, A. Okhotin, Representing hyper-arithmetical sets by equations over sets of integers, Theory of Computing Systems. - Vol. 51, nr 2 (2012), s. 196-228. (http://dx.doi.org/10.1007/s00224-011-9352-5)
  27. A. Jeż, Faster fully compressed pattern matching by recompression, Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I / ed. by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer. - Berlin, Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7391). - S. 533-544. (http://dx.doi.org/10.1007/978-3- 642-31594-7_45)
  28. A. Jeż, A. Maletti, Hyper-minimization for deterministic tree automata, Implementation and Application of Automata : 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012 : proceedings / ed. by Nelma Moreira, Rogério Reis. - Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. - (Lecture Notes in Computer Science ; 7381). - S. 217-228. (http://dx.doi.org/10.1007/978-3-642- 31606-7_19)
  29. A. Jeż, A. Okhotin, On the number of nonterminal symbols in unambiguous conjunctive grammars, Descriptional Complexity of Formal Systems : 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012 : proceedings / ed. by Martin Kutrib, Nelma Moreira, Rogério Reis. - Berlin, Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7386). - S. 183-195. (http://dx.doi.org/10.1007/978-3-642-31623-4_14)
  30. E. Kieroński, J. Michaliszyn, Two-variable universal logic with transitive closure, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France / Patrick Cégielski, Arnaud Durand (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.16).- S. 396-410. (http://dx.doi.org/10.4230/LIPIcs.CSL.2012.396)
  31. E. Kieroński, M. Otto, Small substructures and decidability issues for first-order logic with two variables, Journal of Symbolic Logic. - Vol. 77, iss. 3 (2012), s. 729-765. (http://projecteuclid.org/DPubS?service=UI)
  32. J. Michaliszyn, J. Otop, P. Witkowski, Satisfiability vs. finite satisfiability in elementary modal logics, Electronic Proceedings in Theoretical Computer Science. - Vol. 96 (2012), s. 141-154. (http://dx.doi.org/10.4204/EPTCS.96.11)
  33. K. Paluch, Faster and simpler approximation of stable matchings, Approximation and online algorithms : 9th international workshop ; revised selected papers : WAOA 2011, Saarbruecken, Germany, September 8-9, 2011 / (ed.)Roberto Solis-Oba, Giuseppe Persiano. - Berlin ; Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7164). - S. 176-187.
  34. S. Staworko, P. Wieczorek, Learning twig and path queries, EDBT/ICDT 2012 Joint Conference : Electronic Conference Proceedings : March 26-30, 2012, Berlin, Germany / Ismail Ari (ed.). - Berlin : ACM, 2012. (http://www.edbt.org/Proceedings/2012-Berlin/papers/icdt/a20-Staworko.pdf)
  35. P. Filipiak, K. Michalak, P. Wnuk-Lipiński, A predictive evolutionary algorithm for dynamic constrained inverse kinematics problems, Hybrid Artificial Intelligent Systems : 7th International Conference, HAIS 2012, Salamanca, Spain, March 28-30th, 2012. Proceedings, Part I / Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michal Woźniak, Manuel Grana, Sung-Bae Cho (Eds.). - Berlin, Heidelberg : Springer, 2012. - (Lecture Notes in Artificial Intelligence ; nr 7208).- S. 610-621. (http://dx.doi.org/10.1007/978-3-642-28942-2_55)
  36. W. Bożejko, Z. Hejducki, P. Rajba, M. Wodecki, Algorytm memetyczny dla pewnego problemu potokowego w budownictwie, Innowacje w zarządzaniu i inżynierii produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2012, 251-262, RK.
  37. W. Bożejko, Z. Hejducki, M. Uchroński, M. Wodecki, System wspomagania harmonogramowania przedsięwzięć budowlanych, Innowacje w zarządzaniu i inżynierii produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2012, RK.
  38. W. Bożejko, P. Rajba, M. Wodecki, Arrangement Algorithms Stability with Probabilistic Parameters of Tasks, Proceedings of APCAST 2012, 14th International Asia Pacific Conference on Computer Aided System Theory, 6th to 8th February, 2012, Sydney, Australia (2012) 120-122, RK.
  39. W. Bożejko, S. Jagiełło, M. Wodecki, A survey of parallel local search methods application in scheduling and logistics, Proceedings of the International Conference on ICT Management for Global Competitiveness and Economic Growth in Emerging Economies ICTM 2012, 214-232, RK.
  40. W. Bożejko, P. Rajba, M. Wodecki, Scheduling problem with uncertain parameters, Proceedings of the International Conference on ICT Management for Global Competitiveness and Economic Growth in Emerging Economies ICTM 2012, 262-273, RK.
  41. W. Bożejko, M. Uchroński, M. Wodecki, Elastyczny problem gniazdowy - równoległy algorytm przeszukiwania z tabu dla multi-GPU, Automatyzacja Procesów Dyskretnych, Teoria i zastosowania (red. A. Świerniak, J. Krystek), Tom I, Gliwice (2012), 15-22, RK.
  42. W. Bożejko, M. Uchroński, M. Wodecki, Wielomaszynowy problem szeregowania zadań z przezbrojeniami, Automatyzacja Procesów Dyskretnych, Teoria i zastosowania (red. A. Świerniak, J. Krystek), Tom I, Gliwice (2012), 23-31, RK.
  43. W. Bożejko, Z. Hejducki, M. Wodecki, Harmonogramowanie robót budowlanych, Optymalizacja dyskretna w informatyce, automatyce i robotyce, (red. W.Bożejo, J.Pempera), Wydawnictwo Politechniki Wrocławskiej, Wrocław 2012, 195-219, RK.
  44. M. Uchroński, M. Wodecki, Elastyczne systemy produkcyjne, Optymalizacja dyskretna w informatyce, automatyce i robotyce, (red. W.Bożejo, J.Pempera), Wydawnictwo Politechniki Wrocławskiej, Wrocław 2012, 221-255, RK.
  45. E. Gurbiel, G. Hardt-Olejniczak, E. Kołczyk, H. Krupicka, M. M. Sysło, Informatyka to podstawa, Podręcznik dla liceum ogólnokształcącego, liceum profilowanego i technikum, s. 184, ISBN: 978-83-02-11898- 2, WSiP, Warszawa 2012, wyd. I, R.
  46. A. B. Kwiatkowska, Z. Nowakowski, M. M. Sysło, E-nauczyciel. Standardy, certyfikaty, sylabusy, Materiały szkoleniowe, Opole 2012.
  47. A. Bartkowiak, R. Zimroz, Multidimensional data analysis for condition monitoring: features selection and data classification, CM 2012 / MFPT 2012 - The Ninth International Conference on Condition Monitoring and Machinery Failure Prevention Technologies. Electronic Proceedings, [CD-ROM], Paper 402, pp. 1-12. ISBN 978-1-901892-36-9. Publisher: Coxmoor Publishing Co., Oxfordshire, 2012, RK.
  48. M. Bieńkowski, Migrating and Replicating Data in Networks Computer Science, Research and Development, vol. 27, issue 3, 169-179, 2012. Wyd.: Springer. (http://www.ii.uni.wroc.pl/~mbi/papers/2012-csrd-migration-replication-survey.pdf)
  49. M. Bieńkowski, J. Kutyłowski, The k-Resource Problem in Uniform Metric, Spaces, Theoretical Computer Science, vol. 459,42-54,2012. Wyd.: Elsevier. (http://www.sciencedirect.com/science/article/pii/S0304397512006214)
  50. D. Biernacki, M. Materzok, A Dynamie Interpretation of the CPS Hierarchy, R. Jhala and A. Igarashi, editors, Proceedings of the l0th Asian Symposium on Programming Languages and Systems (APLAS 2012), Kyoto, Japan, December 2012. (http://www.ii.uni.wroc. pl/~dabi/publications/APLAS12/materzok-biernacki-aplasl2.pdf)
  51. D. Biernacki, S. Lenglet, Normal Form Bisimulations for Delimited-Control Operators, T. Shrijvers and P. Thiemann, editors, Proceedings of the 11th International Symposium on Functional and Logic Programming (FLOPS 2012), Kobe, Japan, May 2012. (http: //www.ii.uni.wroc.pl/~dabi/publications/FL0PS12/biernacki-lenglet -flopsl2.pdf.)
  52. A. Jeż, T. Jurdziński, Length-reducing Automata (almost) without Auxiliary Symbols, Journal of Automata, Languages and Combinatorics, Otto-von-Guericke-Universitat, 16(2-4): 141-164 (2011); RK.
  53. T. Jurdziński, D. R. Kowalski, Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks, Distributed Computing - 26th International Sympodium (DISC 2012), LNCS 7611, Springer, 2012, 106-120; RK.
  54. T. Jurdziński, D. R. Kowalski, On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks, 16th International Conference On Principles Of Distributed Systems (OPODIS 2012), LNCS 7702, Springer, 2012, 209-224;RK.
  55. E. Kieroński, J. Michaliszyn, Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames, AIML 2012. 27th Annual Symposium on Advances in Modal Logic. Copenhagen, Denmark, August 25-28, 2012. Proceedings, pages 464-482, RK.
  56. S. Staworko, J. Chomicki, J. Marcinkowski, Prioritized repairing and consistent query answering in relational databases, Annals of Mathematics and Artificial Intelligence . 64(2-3): 209-246 (2012), RF.
  57. J. Michaliszyn, P. Wieczorek, A. Muscholl, S. Staworko, Z. Wu, On Injective Embeddings of Tree Patterns, (http://arxiv.org/pdf/1204.4948)
  58. A. B. Kwiatkowska, M. M. Sysło, Book Embedding of N-Free Posets, EuroCG 2012, Asyz, Włochy, 19-21.03.2012, RK.
  59. M. M. Sysło, Zasoby otwarte - prawdy i fikcje. Środowiska wirtualne zamiast e-podręczników, Meritum, 4, 2012, R.
  60. P. Filipiak, P. Wnuk-Lipiński, Parallel CHC Algorithm for Solving Dynamic Traveling Salesman Problem Using Many-Core GPU, Artificial Intelligence: Methodology, Systems, and Applications, Lecture Notes in Computer Science, vol. 7557, Springer, 2012,pp.305-314, RK.
  61. P. Filipiak, K. Michalak, P. Wnuk-Lipiński, Evolutionary Approach to Multiobjective Optimization of Portfolios That Reflect the Behaviour of Investment Funds, Artificial Intelligence: Methodology, Systems, and Applications, Lecture Notes in Computer Science, vol. 7557, Springer, 2012, pp.202-211, RK.
  62. W. Bożejko, Z. Hejducki, M. Wodecki, Applying metaheuristic strategies in construction projects management, Journal of Civil Engineering and Management, Taylor & Francis, (2012) Volume 18(5), 621-630, RF.
  63. W. Bożejko, M. Uchroński, M. Wodecki, Parallel Cost Function Determination on GPU for the Job Shop Scheduling Problem, Proceedings of PPAM 2011, Lecture Notes in Computer Science No. 7204, Springer (2012), 1-10,RK.
  64. W. Bożejko, M. Uchroński, M. Wodecki, Solving the Flexible Job Shop Problem on Multi-GPU, Proceedings of ICCS 2012, Procedia Computer Science, Elsevier, 9 (2012) 2020 - 2023, RK.
  65. W. Bożejko, M. Uchroński, M. Wodecki, Solving the flexible job shop problem on GPU, Proceedings of ICAISC 2012, Lecture Notes in Artificial Intelligence No. 7268, Springer (2012), 387-394, RK.
  66. W. Bożejko, M. Uchroński, M. Wodecki, Fast parallel cost function calculation for the flow shop scheduling problem, Proceedings of ICAISC 2012, Lecture Notes in Artificial Intelligence No. 7268, Springer (2012), 378-386, RK.
  67. W. Bożejko, M. Uchroński, M. Wodecki, Multi-machine scheduling problem with setup limes, Archives of Control Sciences, Volume 22(LVIII), No. 4, 2012, R.
  68. W. Bożejko, M. Uchroński, M. Wodecki, Flexible job shop problem - parallel tabu serach algorithm for multi-GPU, Archives of Control Sciences, Volume 22(LVIII), No. 4, 2012, R.
  69. A. Kościelski, Uwagi o indukcji matematycznej, Matematyka. - R. 65, nr 5 (2012), s. 25-31.
  70. M. M. Sysło, Homo informaticus: czyli człowiek w zinformatyzowanym świecie, red. nauk. Maciej M. Sysło Warszawa : Warszawska Wyższa Szkoła Informatyki, 2012. - 310 s.
  71. M. M. Sysło, Indywidualizacja kształcenia: idee, metody, narzędzia, Człowiek, media, edukacja / pod red. nauk. Janusza Morbitzera i Emilii Musiał. - Kraków : Katedra Technologii i Mediów Edukacyjnych. Uniwersytet Pedagogiczny im. KEN w Krakowie, 2012. - S. 576-588.
  72. P. Rajba, M. Wodecki, Stability of scheduling with random processing times on one machine, Applicationes Mathematicae. - Vol. 39, nr 2 (2012), s. 169-183.
  73. J. Byrka, B. Rybicki, Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location, ICALP (1) 2012: 157-169.
Adres:
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
Sekretariat
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
sekretariat@ii.uni.wroc.pl
Dziekanat
tel.: 71 375 7892
dziekan@ii.uni.wroc.pl
sprawy studenckie:
dziekanat@ii.uni.wroc.pl
Portiernia
tel.: 71 375 7958
Redaktor strony WWW
redaktor@ii.uni.wroc.pl
Projekt
MAKOS