4432 search results - page 328 / 887 » Solving Demodulation as an Optimization Problem |
148
click to vote
CODES
2003
IEEE
15 years 9 months ago
2003
IEEE
Distributed embedded systems implemented with mixed, eventtriggered and time-triggered task sets, which communicate over bus protocols consisting of both static and dynamic phases...
139
click to vote
STOC
1989
ACM
15 years 8 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
134
click to vote
ITS
2000
Springer
15 years 8 months ago
2000
Springer
DT Tutor uses a decision-theoretic approach to select tutorial actions for coached problem solving that are optimal given the tutor's beliefs and objectives. It employs a mode...
142
click to vote
CPAIOR
2010
Springer
15 years 7 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
161
click to vote
AAAI
2007
15 years 6 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...