Sciweavers

8 search results - page 2 / 2
» A Backtracking-Based Algorithm for Computing Hypertree-Decom...
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
15 years 10 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
COMCOM
1998
102views more  COMCOM 1998»
14 years 9 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...