Sciweavers

9842 search results - page 321 / 1969
» Problem complexity
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
ICSE
2009
IEEE-ACM
16 years 7 months ago
In-field healing of integration problems with COTS components
Developers frequently integrate complex COTS frameworks and components in software applications. COTS products are often only partially documented, and developers may misuse techn...
Hervé Chang, Leonardo Mariani, Mauro Pezz&e...
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
16 years 29 days ago
The multi-objective next release problem
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objecti...
Yuanyuan Zhang, Mark Harman, S. Afshin Mansouri
COCOON
2005
Springer
16 years 10 days ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
WSC
2008
15 years 9 months ago
Simulation-based optimization for the quay crane scheduling problem
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...
Pasquale Legato, Rina Mary Mazza, Roberto Trunfio