5757 search results - page 472 / 1152 » Dynamic Policy Programming |
187
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
185
click to vote
ICAC
2005
IEEE
16 years 15 days ago
2005
IEEE
Track 2 - Modeling and Abstraction of Services Process Session Chair: Dynamic Service Invocation Control in Service Composition Environments (SCC2010-2004) ...........................
181
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
331
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
188
click to vote
IACR
2011
14 years 6 months ago
2011
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...