4103 search results - page 82 / 821 » Some results on the Collatz problem |
176
click to vote
WAOA
2005
Springer
15 years 12 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
170
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
142
Voted
EOR
2006
15 years 6 months ago
2006
This paper presents a new data classification method based on mixed-integer programming. Traditional approaches that are based on partitioning the data sets into two groups perfor...
174
click to vote
ADHOCNOW
2008
Springer
16 years 23 days ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
157
click to vote
GECCO
2007
Springer
16 years 17 days ago
2007
Springer
Recent studies on the support of engineers during conceptual design resulted in a non-traditional type of Multi-Objective Problems (MOPs), namely concept-based ones. In concept-ba...