CORR
2008
Springer
13 years 10 months ago
2008
Springer
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
CORR
2008
Springer
13 years 10 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
2008
Springer
13 years 10 months ago
2008
Springer
Position control devices enable precise selection, but significant clutching degrades performance. Clutching can be reduced with high control-display gain or pointer acceleration,...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We propose a method for statistical analysis of time series, that allows us to obtain solutions to some classical problems of mathematical statistics under the only assumption tha...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract--We consider multiaccess multiple-input multipleoutput (MIMO) systems with finite rate feedback with the aim of understanding how to efficiently employ the given feedback ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The sum-capacity is studied for a K-user physically degraded Gaussian multiaccess relay channel (MARC). Decodeand-forward (DF) is shown to achieve the sum-capacity and capacity reg...
CORR
2008
Springer
13 years 10 months ago
2008
Springer