592 search results - page 45 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
179
click to vote
SOCC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
149
click to vote
CPAIOR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
EMNLP
2008
15 years 6 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
139
Voted
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
142
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...