Sciweavers

89 search results - page 4 / 18
» Pareto-optimality of compromise decisions
Sort
View
IJNSEC
2011
232views more  IJNSEC 2011»
13 years 1 months ago
Location-aware, Trust-based Detection and Isolation of Compromised Nodes in Wireless Sensor Networks
The detection and isolation of compromised nodes in wireless sensor networks is a difficult task. However, failure to identify and isolate compromised nodes results in significan...
Garth V. Crosby, Lance Hester, Niki Pissinou
IDEAL
2003
Springer
13 years 11 months ago
Agent Compromises in Distributed Problem Solving
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
Yi Tang, Jiming Liu, Xiaolong Jin
CCGRID
2009
IEEE
13 years 7 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
DAGSTUHL
2007
13 years 7 months ago
Parallel Universes: Multi-Criteria Optimization
In this paper parallel universes are defined by their relation to multi-criteria optimization combined with an explicit or implicit link for the unambiguous identification of an ...
Claus Weihs, Heike Trautmann
KDD
2000
ACM
129views Data Mining» more  KDD 2000»
13 years 9 months ago
Evolutionary algorithms in data mining: multi-objective performance modeling for direct marketing
Predictive models in direct marketing seek to identify individuals most likely to respond to promotional solicitations or other intervention programs. While standard modeling appr...
Siddhartha Bhattacharyya