2168 search results - page 188 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
126
click to vote
MP
2010
15 years 2 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
102
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
To accelerate the learning of reinforcement learning, many types of function approximation are used to represent state value. However function approximation reduces the accuracy o...
130
click to vote
AAAI
2000
15 years 5 months ago
2000
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
159
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
150
click to vote
ACMICEC
2008
ACM
15 years 6 months ago
2008
ACM
This paper focuses on the problem of how to allow sharing of copyrighted content between a set of authorised devices and preventing unauthoried copying of content to other devices...