Sciweavers

366 search results - page 65 / 74
» Agent Compromises in Distributed Problem Solving
Sort
View
CN
2007
148views more  CN 2007»
13 years 7 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
ECRIME
2007
13 years 11 months ago
Evaluating a trial deployment of password re-use for phishing prevention
We propose a scheme that exploits scale to prevent phishing. We show that while stopping phishers from obtaining passwords is very hard, detecting the fact that a password has bee...
Dinei A. F. Florêncio, Cormac Herley
TPDS
2008
124views more  TPDS 2008»
13 years 7 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 8 months ago
Agent-based support for interactive search in conceptual software engineering design
While recent attempts to search a conceptual software engineering design search space with multi-objective evolutionary algorithms have yielded promising results, the practical ap...
Christopher L. Simons, Ian C. Parmee
ATAL
2009
Springer
14 years 1 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig