Sciweavers

1404 search results - page 163 / 281
» Complexity of admissible rules
Sort
View
ATAL
2006
Springer
14 years 18 days ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
RSA
2008
80views more  RSA 2008»
13 years 7 months ago
The persistent-access-caching algorithm
ABSTRACT: Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching syste...
Predrag R. Jelenkovic, Ana Radovanovic
SIAMJO
2010
136views more  SIAMJO 2010»
13 years 3 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ICDE
2008
IEEE
192views Database» more  ICDE 2008»
14 years 10 months ago
Verifying and Mining Frequent Patterns from Large Windows over Data Streams
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
Barzan Mozafari, Hetal Thakkar, Carlo Zaniolo
ICPR
2006
IEEE
14 years 10 months ago
Testing The Torah Code Hypothesis: The Experimental Protocol
This is the second part of a tutorial discussing the experimental protocol issues in Testing the Torah Code Hypothesis. The principal concept is the test statistic which is used t...
Robert M. Haralick