Sciweavers

43 search results - page 5 / 9
» Solution of Scott's problem on the number of directions dete...
Sort
View
MICS
2010
124views more  MICS 2010»
13 years 2 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
TMC
2008
112views more  TMC 2008»
13 years 7 months ago
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
Sensor deployment is a critical issue because it affects the cost and detection capability of a wireless sensor network. In this work, we consider two related deployment problems: ...
You-Chiun Wang, Chun-Chi Hu, Yu-Chee Tseng
EPIA
2007
Springer
14 years 1 months ago
Improving Evolutionary Algorithms with Scouting
The goal of an Evolutionary Algorithm(EA) is to find the optimal solution to a given problem by evolving a set of initial potential solutions. When the problem is multi-modal, an ...
Konstantinos Bousmalis, Gillian M. Hayes, Jeffrey ...
TPDS
2002
136views more  TPDS 2002»
13 years 7 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
GECCO
2008
Springer
163views Optimization» more  GECCO 2008»
13 years 8 months ago
Embedded evolutionary multi-objective optimization for worst case robustness
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
Gideon Avigad, Jürgen Branke