Sciweavers

14518 search results - page 168 / 2904
» Two Problems for Sophistication
Sort
View
RE
2004
Springer
14 years 4 months ago
Architecture-driven Problem Decomposition
Jackson’s Problem Frames provide a means of analysing and decomposing problems. They emphasise the world outside the computer helping the developer to focus on the problem domai...
Lucia Rapanotti, Jon G. Hall, Michael Jackson, Bas...
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
14 years 3 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
IPCCC
2007
IEEE
14 years 5 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
CCCG
2010
14 years 3 days ago
New variations of the reverse facility location problem
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
Bhaswar B. Bhattacharya, Subhas C. Nandy
BMCBI
2010
175views more  BMCBI 2010»
13 years 10 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...