Sciweavers

3172 search results - page 150 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
AIPS
2011
14 years 10 months ago
Effective Heuristics and Belief Tracking for Planning with Incomplete Information
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
Alexandre Albore, Miquel Ramírez, Hector Ge...
ACC
2011
65views more  ACC 2011»
14 years 6 months ago
Measuring the Deployment Hiccups of DNSSEC
On May 5, 2010 the last step of the DNSSEC deployment on the 13 root servers was completed. DNSSEC is a set of security extensions on the traditional DNS protocol, that aim in prev...
Vasilis Pappas, Angelos D. Keromytis
APPROX
2011
Springer
249views Algorithms» more  APPROX 2011»
14 years 6 months ago
A Canonical Form for Testing Boolean Function Properties
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
Dana Dachman-Soled, Rocco A. Servedio
CVPR
2012
IEEE
13 years 9 months ago
Icon scanning: Towards next generation QR codes
Undoubtedly, a key feature in the popularity of smartmobile devices is the numerous applications one can install. Frequently, we learn about an application we desire by seeing it ...
Itamar Friedman, Lihi Zelnik-Manor
PODC
2012
ACM
13 years 9 months ago
Brief announcement: a calculus of policy-based routing systems
The BGP (Border Gateway Protocol) is the single inter-domain routing protocol that enables network operators within each autonomous system (AS) to influence routing decisions by ...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...