2398 search results - page 410 / 480 » Constraint Programming and Graph Algorithms |
105
click to vote
IEEEPACT
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...
134
click to vote
FOCS
2002
IEEE
15 years 7 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...
107
click to vote
AINA
2006
IEEE
15 years 6 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...
144
click to vote
CAISE
2004
Springer
15 years 6 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...
134
click to vote
AAAI
2010
15 years 3 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...