1133 search results - page 218 / 227 » Best Practices in e-Assessment |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We develop sub-Nyquist sampling systems for analog signals comprised of several, possibly overlapping, finite duration pulses with unknown shapes and time positions. Efficient sam...
117
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must b...
AI
2006
Springer
14 years 12 months ago
2006
Springer
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
BMCBI
2006
14 years 11 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...