Sciweavers

3628 search results - page 390 / 726
» The Decision Diffie-Hellman Problem
Sort
View
AAAI
2008
15 years 9 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
DAGSTUHL
2007
15 years 8 months ago
Implementing RPO and POLO using SAT
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
Peter Schneider-Kamp, Carsten Fuhs, René Th...
IIS
2004
15 years 8 months ago
Automatic Understanding of Signals
Using computers for different task including enhancement, description and evaluation of signals we typically include three steps: signal processing (for obtaining signal of better ...
Ryszard Tadeusiewicz
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 7 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
15 years 6 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins