942 search results - page 177 / 189 » Constraints in Graph Drawing Algorithms |
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
ICRA
2002
IEEE
14 years 2 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
AINA
2006
IEEE
14 years 1 months ago
2006
IEEE
Using beam forming antennas in ad hoc networks have been recently focused on, in order to improve the space reuse. This news context implies to revisit network algorithms because t...
CAISE
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
AAAI
2010
13 years 11 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...