Sciweavers

948 search results - page 135 / 190
» What can we achieve by arbitrary announcements
Sort
View
ATAL
2010
Springer
13 years 10 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
IACR
2011
173views more  IACR 2011»
12 years 8 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
AAAI
2007
13 years 11 months ago
Action-Based Alternating Transition Systems for Arguments about Action
This paper presents a formalism to describe practical reasoning in terms of an Action-based Alternating Transition System (AATS). The starting point is a previously specified acc...
Katie Atkinson, Trevor J. M. Bench-Capon
IAT
2010
IEEE
13 years 6 months ago
Comparing Tag Clouds, Term Histograms, and Term Lists for Enhancing Personalized Web Search
Although static ranked lists remain the dominant Web search interface, they can limit the ability of Web searchers to find desired information when it is buried deep in the collect...
Orland Hoeber, Hanze Liu
AINA
2007
IEEE
14 years 26 days ago
Using Argumentative Agents to Manage Communities of Web Services
This paper presents a framework for specifying Web services communities. A Web service is an accessible application that humans, software agents, and other applications in general ...
Jamal Bentahar, Zakaria Maamar, Djamal Benslimane,...