Sciweavers

2657 search results - page 282 / 532
» On the complexity of hierarchical problem solving
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
Scheduling Algorithms for a Cache Pre-Filling Content Distribution Network
Abstract—Cache pre-filling is emerging as a new concept for increasing the availability of popular web items in cache servers. According to this concept, web items are sent by a...
Reuven Cohen, Liran Katzir, Danny Raz
ATAL
2003
Springer
15 years 10 months ago
Analyzing the efficiency of strategies for MAS-based sensor interpretation and diagnosis
One of the factors holding back the application of multiagent, distributed approaches to large-scale sensor interpretation and diagnosis problems is the lack of good techniques fo...
Norman Carver, Ruj Akavipat
PATAT
1995
Springer
122views Education» more  PATAT 1995»
15 years 10 months ago
A Memetic Algorithm for University Exam Timetabling
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
Edmund K. Burke, James P. Newall, Rupert F. Weare
AIIA
1991
Springer
15 years 10 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
AAAI
2007
15 years 9 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein