23590 search results - page 507 / 4718 » Algorithm Performance Contest |
237
click to vote
SLS
2009
Springer
15 years 9 months ago
2009
Springer
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
119
click to vote
SPAA
2000
ACM
15 years 9 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
160
Voted
CAV
2006
Springer
15 years 8 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
119
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
135
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...