Sciweavers

26354 search results - page 4900 / 5271
» How we refactor, and how we know it
Sort
View
SECON
2007
IEEE
16 years 1 months ago
A Mechanism for Detecting and Responding to Misbehaving Nodes in Wireless Networks
Abstract—While mechanisms exist to instantiate common security functionality such as confidentiality and integrity, little has been done to define a mechanism for identificati...
Damon McCoy, Douglas C. Sicker, Dirk Grunwald
SEW
2007
IEEE
16 years 1 months ago
Testing Patterns
: After over a decade of use, design patterns continue to find new areas of application. In previous work, we presented a contract formalism for specifying patterns precisely, and...
Neelam Soundarajan, Jason O. Hallstrom, Adem Delib...
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
16 years 1 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
ATAL
2007
Springer
16 years 1 months ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
16 years 1 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
« Prev « First page 4900 / 5271 Last » Next »