3897 search results - page 385 / 780 » complexity 2010 |
169
click to vote
COLING
2010
15 years 1 months ago
2010
In this paper, we consider sentence simplification as a special form of translation with the complex sentence as the source and the simple sentence as the target. We propose a Tre...
172
click to vote
HEURISTICS
2010
15 years 1 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
209
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
195
click to vote
PE
2010
Springer
15 years 1 months ago
2010
Springer
A central question in designing server farms today is how to efficiently provision the number of servers to extract the best performance under unpredictable demand patterns while ...
198
click to vote
TCS
2010
15 years 1 months ago
2010
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of...