12519 search results - page 409 / 2504 » Approximation Problems Categories |
195
click to vote
WAOA
2005
Springer
16 years 9 days 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”, ...
178
click to vote
HICSS
1994
IEEE
15 years 11 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
185
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 ...
160
click to vote
RANLP
2003
15 years 8 months ago
2003
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...
346
click to vote
EOR
2007
15 years 6 months ago
2007
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...