2636 search results - page 321 / 528 » Linear Programming |
120
Voted
MIG
2010
Springer
15 years 1 months ago
2010
Springer
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
131
Voted
MP
2010
15 years 1 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
165
Voted
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
—Dynamic spectrum access (DSA) aims to improve spectrum efficiency via spectrum sensing and optimal spectrum access. An essential component in DSA is the joint design of sensing...
151
Voted
ACL
2010
15 years 1 months ago
2010
For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
127
Voted
ACL
2010
15 years 1 months ago
2010
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...