942 search results - page 97 / 189 » Constraints in Graph Drawing Algorithms |
114
Voted
IJMC
2006
15 years 2 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
138
Voted
ALGOSENSORS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...
128
Voted
IJDSN
2008
15 years 2 months ago
2008
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
129
Voted
DISOPT
2007
15 years 2 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
106
Voted
AICCSA
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper presents an encoding algorithm that is very efficient for many different logic synthesis problems. The algorithm is based on the use of special tables and includes two ...