Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Basilis Boutsinas

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Georgios Pavlides

> Home > Persons > Basilis Boutsinas

Publications

2002
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jc/VrahatisBAP02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/VrahatisBAP02
Michael N. Vrahatis, Basilis Boutsinas, Panagiotis D. Alevizos, Georgios Pavlides:
The New k-Windows Algorithm for Improving the k-Means Clustering Algorithm. J. Complex. 18(1): 375-391 (2002)
1997
[p1]
- view
  authority control:
- export record
  dblp key:
  - books/el/97/BoutsinasSP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/el/97/BoutsinasSP97
Basilis Boutsinas, Yannis C. Stamatiou, Georgios Pavlides:
Massively parallel support for nonmonotonic reasoning. Parallel Processing for Artificial Intelligence 3 1997: 41-67
1996
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/ershov/BoutsinasPP96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ershov/BoutsinasPP96
Basilis Boutsinas, Stergios Papadimitriou, Georgios Pavlides:
Automatic Analysis, Verification and Synthesis of Rule-Based Real-Time Decision Making Systems with Machine Learning Assistance. Ershov Memorial Conference 1996: 134-145

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.