Sciweavers

2862 search results - page 10 / 573
» Bicriteria Network Design Problems
Sort
View
ICANNGA
2007
Springer
153views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Automatic Design of ANNs by Means of GP for Data Mining Tasks: Iris Flower Classification Problem
This paper describes a new technique for automatically developing Artificial Neural Networks (ANNs) by means of an Evolutionary Computation (EC) tool, called Genetic Programming (G...
Daniel Rivero, Juan R. Rabuñal, Julian Dora...
SCN
2010
Springer
120views Communications» more  SCN 2010»
13 years 2 months ago
Identity crisis: on the problem of namespace design for ID-PKC and MANETs
In this paper we explore the "interface" between Identity-based Public Key Cryptography (ID-PKC) and Mobile Ad-hoc Networks (MANETs). In particular we examine the problem...
Shane Balfe, Andrew D. McDonald, Kenneth G. Paters...
SOICT
2010
13 years 2 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
ANOR
2007
80views more  ANOR 2007»
13 years 7 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
NETWORKS
2008
13 years 7 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth