2560 search results - page 145 / 512 » Contributions to zero-sum problems |
100
Voted
CADE
2002
Springer
16 years 28 days ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
112
Voted
MOBIHOC
2008
ACM
16 years 7 days ago
2008
ACM
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
98
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
CSCLP
2007
Springer
15 years 6 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
108
Voted
DAGM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...