Sciweavers

3708 search results - page 721 / 742
» Approximating Betweenness Centrality
Sort
View
COMCOM
2006
147views more  COMCOM 2006»
13 years 8 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 8 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
EC
2006
121views ECommerce» more  EC 2006»
13 years 8 months ago
A Study of Structural and Parametric Learning in XCS
The performance of a learning classifier system is due to its two main components. First, it evolves new structures by generating new rules in a genetic process; second, it adjust...
Tim Kovacs, Manfred Kerber
IJAR
2008
118views more  IJAR 2008»
13 years 8 months ago
Dynamic multiagent probabilistic inference
Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system diagnosis to reason about the states of the distributed unc...
Xiangdong An, Yang Xiang, Nick Cercone