Sciweavers

3082 search results - page 284 / 617
» New Bounds for the Controller Problem
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 7 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
CP
2007
Springer
16 years 25 days ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
IJCAI
1989
15 years 7 months ago
A Sequential View of AND-Parallelism Through Partial AND-Processes
Most implementations of AND-parallelism tackle the shared variable problem by running literals in parallel only if they have no variables in common and thus are independent from e...
Bernd Schend
WISTP
2010
Springer
15 years 4 months ago
Efficient Mutual Authentication for Multi-domain RFID Systems Using Distributed Signatures
Abstract. The use of RFID technology in complex and distributed environments often leads to a multi-domain RFID system in which security issues such as authentication of tags and r...
Michael Braun, Ulrike Meyer, Susanne Wetzel
CDC
2008
IEEE
206views Control Systems» more  CDC 2008»
16 years 1 months ago
Approximate dynamic programming using support vector regression
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
Brett Bethke, Jonathan P. How, Asuman E. Ozdaglar