4428 search results - page 86 / 886 » The Chow Parameters Problem |
124
click to vote
STRINGOLOGY
2008
15 years 4 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
149
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
146
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
123
click to vote
INFORMATICALT
2010
15 years 1 months ago
2010
The asymmetric cipher protocol, based on decomposition problem in matrix semiring M over semiring of natural numbers N is presented. The security of presented cipher protocol is ba...
123
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...