14386 search results - page 215 / 2878 » The Chinese Generals Problem |
150
click to vote
JALC
2002
15 years 3 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
119
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
We address a large scale waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and drivers lunch breaks. A fitness search spac...
194
click to vote
ISTCS
1997
Springer
15 years 8 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
155
click to vote
CATS
2006
15 years 5 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
156
click to vote
BIRTHDAY
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...