Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540874768, 9783540874775

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Disaggregation of Bipolar-Valued Outranking Relations

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_23 ◽

2008 ◽

pp. 204-213 ◽

Cited By ~ 2

Author(s):

Patrick Meyer ◽

Jean-Luc Marichal ◽

Raymond Bisdorff

Keyword(s):

Outranking Relations

Download Full-text

Evolutionary Optimisation of Kernel and Hyper-Parameters for SVM

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_12 ◽

2008 ◽

pp. 107-116

Author(s):

Laura Dioşan ◽

Alexandrina Rogozan ◽

Jean-Pierre Pécuchet

Keyword(s):

Evolutionary Optimisation

Download Full-text

A Competitive Neural Network for Intrusion Detection Systems

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_56 ◽

2008 ◽

pp. 530-537 ◽

Cited By ~ 1

Author(s):

Esteban José Palomo ◽

Enrique Domínguez ◽

Rafael Marcos Luque ◽

José Muñoz

Keyword(s):

Neural Network ◽

Intrusion Detection ◽

Intrusion Detection Systems ◽

Competitive Neural Network ◽

Detection Systems

Download Full-text

Wireless Traffic Service Communication Platform for Cars

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_58 ◽

2008 ◽

pp. 548-557 ◽

Cited By ~ 1

Author(s):

Timo Sukuvaara ◽

Pertti Nurmi ◽

Daria Stepanova ◽

Sami Suopajärvi ◽

Marjo Hippi ◽

...

Keyword(s):

Communication Platform

Download Full-text

Linear Reformulations of Integer Quadratic Programs

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_5 ◽

2008 ◽

pp. 43-51 ◽

Cited By ~ 4

Author(s):

Alain Billionnet ◽

Sourour Elloumi ◽

Amélie Lambert

Keyword(s):

Quadratic Programs

Download Full-text

Challenging the Incomparability Problem: An Approach Methodology Based on ZAPROS

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_37 ◽

2008 ◽

pp. 338-347 ◽

Cited By ~ 17

Author(s):

Isabelle Tamanini ◽

Plácido Rogério Pinheiro

Download Full-text

Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_26 ◽

2008 ◽

pp. 234-243

Author(s):

Bach Kim Nguyen Thi ◽

Hoai An Le Thi ◽

Minh Thanh Tran

Keyword(s):

Approximation Algorithm ◽

Efficient Sets ◽

Outcome Space

Download Full-text

A Performance Study of Task Scheduling Heuristics in HC Environment

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_24 ◽

2008 ◽

pp. 214-223 ◽

Cited By ~ 2

Author(s):

Ehsan Ullah Munir ◽

Jianzhong Li ◽

Shengfei Shi ◽

Zhaonian Zou ◽

Qaisar Rasool

Keyword(s):

Task Scheduling ◽

Performance Study ◽

A Performance

Download Full-text

The Minimum Weight In-Tree Cover Problem

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_17 ◽

2008 ◽

pp. 155-164

Author(s):

Naoyuki Kamiyama ◽

Naoki Katoh

Keyword(s):

Minimum Weight ◽

Tree Cover ◽

Cover Problem

Download Full-text

Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences ◽

10.1007/978-3-540-87477-5_39 ◽

2008 ◽

pp. 358-368 ◽

Cited By ~ 13

Author(s):

Philippe Vismara ◽

Benoît Valery

Keyword(s):

Constraint Satisfaction ◽

Connected Subgraphs

Download Full-text

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management SciencesLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Disaggregation of Bipolar-Valued Outranking Relations

Evolutionary Optimisation of Kernel and Hyper-Parameters for SVM

A Competitive Neural Network for Intrusion Detection Systems

Wireless Traffic Service Communication Platform for Cars

Linear Reformulations of Integer Quadratic Programs

Challenging the Incomparability Problem: An Approach Methodology Based on ZAPROS

Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets

A Performance Study of Task Scheduling Heuristics in HC Environment

The Minimum Weight In-Tree Cover Problem

Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms

Communications in Computer and Information Science - Modelling, Computation and Optimization in Information Systems and Management Sciences
Latest Publications