Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th SYNASC 2011: Timisoara, Romania
- Dongming Wang, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2011, Timisoara, Romania, September 26-29, 2011. IEEE Computer Society 2011, ISBN 978-1-4673-0207-4
Invited Talks
- Adina Magda Florea
:
Self-Organizing Context Aware Agent Systems. 3-10 - Erich L. Kaltofen:
What is Hybrid Symbolic-Numeric Computation? 11 - Laura Kovács:
Symbol Elimination in Program Analysis. 12 - Gerald Schaefer:
Hybrid Fuzzy Rule-Based Classification. 13-15 - Stephen M. Watt:
Computational Tools for Mathematical Collaboration. 16-18 - Franz Winkler:
What can Symbolic Computation Contribute to Mathematics? 19-20
Symbolic Computation
- Tateaki Sasaki:
A Theory and an Algorithm of Approximate Gröbner Bases. 23-30 - Rémi Imbach, Pascal Mathis, Pascal Schreck:
Tracking Method for Reparametrized Geometrical Constraint Systems. 31-38 - Marco Bodrato, Alberto Zanoni:
Long Integers and Polynomial Evaluation with Estrin's Scheme. 39-46 - Frédéric Chyzak, James H. Davenport, Christoph Koutschan, Bruno Salvy:
On Kahan's Rules for Determining Branch Cuts. 47-51 - Valentin Tanasa, Dorothée Normand-Cyrot:
A Computer Aided Software for Nonlinear Digital Control. 52-59
Numerical Computing
- Octavian Cira, Stefan Maruster:
Optimal Inequality Factor for Ehrlich-Aberth's Method. 63-70 - Ernest Scheiber:
On the Interpolation Trigonometric Polynomial with an Arbitrary Even Number of Nodes. 71-74 - Anton Alin-Adrian:
A Method for Submodelling Inside Transient Flows. 75-82 - Mariusz Felisiak, Daniel Simson:
Experiences in Computing Mesh Root Systems for Dynkin Diagrams Using Maple and C++. 83-86 - Vesna Jevtic, Dalibor Dobrilovic, Jelena Stojanov, Zeljko Stojanov:
Project Duration Assessment Model Based on Modified Shortest Path Algorithm and Superposition. 87-90
Logic and Programming
- Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu:
Estimating the Number of Processors towards an Efficient Non-preemptive Scheduling Algorithm. 93-100 - Isabela Dramnesc, Tudor Jebelean:
Proof Techniques for Synthesis of Sorting Algorithms. 101-109 - Carlo Bellettini, Lorenzo Capra:
Reachability Analysis of Time Basic Petri Nets: A Time Coverage Approach. 110-117 - Matthieu Martel:
RangeLab: A Static-Analyzer to Bound the Accuracy of Finite-Precision Computations. 118-122 - Mihail Asavoae, Irina Mariuca Asavoae:
Using the Executable Semantics for CFG Extraction and Unfolding. 123-127
Artificial Intelligence
- Beáta Reiz, Sándor Pongor:
Psychologically Inspired, Rule-Based Outlier Detection in Noisy Data. 131-136 - Anita Hejja, Robert Andrei Buchmann, Anamaria Szekely:
Integration of Association Rule Detection with Rule-Based Ontological Support for Product Recommendation. 137-144 - Andrei Marin, Florin Pop:
Intelligent Web-History Based on a Hybrid Clustering Algorithm for Future-Internet Systems. 145-152 - Lucian Radu Teodorescu, Razvan Boldizsar, Mihai Alexandru Ordean, Melania Duma, Laura Detesan, Mihaela Ordean:
Part of Speech Tagging for Romanian Text-to-Speech System. 153-159 - Liviu Ciortuz, Vlad Saveluc:
Learning to Unlearn in Lattices of Concepts: A Case Study in Fluid Construction Grammars. 160-167 - Vinicius Almendra, Denis Enachescu:
A Supervised Learning Process to Elicit Fraud Cases in Online Auction Sites. 168-174 - Anamaria Szekely, Anita Hejja, Robert Andrei Buchmann:
Mapping a Relational Database into a RDF Repository. 175-182 - Emilian Necula, Raluca Necula, Adrian Iftene:
A GIS Integrated Solution for Traffic Management. 183-190 - Maria-Iuliana Bocicor, Gabriela Czibula, István Gergely Czibula:
A Reinforcement Learning Approach for Solving the Fragment Assembly Problem. 191-198 - Diana Trandabat:
Towards Extracting Semantic Information from Texts. 199-206 - Liviu Petrisor Dinu, Radu Tudor Ionescu:
A Genetic Approximation of Closest String via Rank Distance. 207-214 - Octav Brudaru, Adrian Vilcu, Diana Popovici:
Cellular Genetic Algorithm with Communicating Grids for a Delivery Problem. 215-221 - Octav Brudaru, Cristian Rotaru, Iulian Marius Furdu:
Static Segregative Genetic Algorithm for Optimizing Variable Ordering of ROBDDs. 222-229 - Mihnea Donciu, Madalina Ionita, Mihai Dascalu, Stefan Trausan-Matu:
The Runner - Recommender System of Workout and Nutrition for Runners. 230-238 - Luminita State, Iuliana Paraschiv-Munteanu:
A Probabilistic Model-Free Approach in Learning Multivariate Noisy Linear Systems. 239-246 - Anca Dinu:
Short Text Categorization via Coherence Constraints. 247-250 - Vinicius Almendra, Bianca Roman:
Using Exploratory Data Analysis for Fraud Elicitation through Supervised Learning. 251-254 - Voichita Popescu, Mihai Bace, Sergiu Nedevschi:
Probabilistic Approach for Automated Reasoning for Lane Identification in Intelligent Vehicles. 255-258
Distributed Computing
- Ioan Lucian Muntean, Laura Maria Dansorean:
Searching Simulation Scenarios on the Grid with ELSIGExplorer. 261-267 - Cristian-Mircea Dinu, Florin Pop, Valentin Cristea:
Pattern Detection Model for Monitoring Distributed Systems. 268-275 - Gabriel Ciobanu, Eneia Nicolae Todoran:
Metric Denotational Semantics for Parallel Rewriting of Multisets. 276-283 - Adrian Mocanu, Nicolae Tapus:
A Distributed Approach for Solving Systems of Nonlinear Equations. 284-290 - Victor Bacu, Danut Mihon, Teodor Stefanut, Denisa Rodila, Dorian Gorgan, Pierluigi Cau, Simone Manca:
Grid Based Services and Tools for Hydrological Model Processing and Visualization. 291-298 - Radu-Ioan Ciobanu, Ciprian Dobre, Valentin Cristea:
A Data Dissemination Algorithm for Opportunistic Networks. 299-305 - Petr Bujok, Josef Tvrdík:
Parallel Migration Models Applied to Competitive Differential Evolution. 306-312 - Alexandru Gherega, Valentin Pupezescu:
Multi-agent Resource Allocation Algorithm Based on the XSufferage Heuristic for Distributed Systems. 313-320
Advances in the Theory of Computing
- Oleg V. Zubkov, Dmitry V. Chistikov, Andrey A. Voronenko:
An Upper Bound on Checking Test Complexity for Almost All Cographs. 323-330 - Andrei Alexandru, Gabriel Ciobanu:
Nominal Semantics of the pi I-calculus. 331-338 - Liliana Cojocaru, Erkki Mäkinen:
On the Complexity of Szilard Languages of Matrix Grammars. 339-347 - Inese Berzina, Raivis Bets, Janis Buls, Edmunds Cers, Liga Kulesa:
On a Non-periodic Shrinking Generator. 348-354
Workshop on Agents for Complex Systems
- Sofia Neata, Andreea Urzica, Adina Magda Florea:
Trust Model for Virtual Organizations. 357-364 - Monica Tirea, Ioan Tandau, Viorel Negru:
Multi-agent Stock Trading Algorithm Model. 365-372 - Calin Sandru:
Enhancing Objects' Autonomy through the Classification of Objects' Interactions. 373-380 - George Sacerdotianu, Sorin Ilie, Costin Badica:
Software Framework for Agent-Based Games and Simulations. 381-388
Workshop on High Performance Computing with Applications in Environment
- Jérôme Frisch, Ralf-Peter Mundani, Ernst Rank:
Communication Schemes of a Parallel Fluid Solver for Multi-scale Environmental Simulations. 391-397
Workshop on Natural Computing and Applications
- Dragos Gavrilut, Liviu Ciortuz:
Dealing with Class Noise in Large Training Datasets for Malware Detection. 401-407 - Réka Nagy, D. Dumitrescu, Rodica Ioana Lung:
Lorenz Equilibrium: Concept and Evolutionary Detection. 408-412
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
