Sciweavers

376 search results - page 14 / 76
» On the Advice Complexity of Online Problems
Sort
View
ATAL
2007
Springer
15 years 5 months ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
88
Voted
CPM
2005
Springer
106views Combinatorics» more  CPM 2005»
15 years 5 months ago
An Optimal Algorithm for Online Square Detection
A square is the concatenation of two identical non-empty strings. Let S be the input string which is given character by character. Let m be the (unknown) smallest integer such that...
Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu
AIPS
2009
15 years 24 days ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
CCGRID
2007
IEEE
15 years 3 months ago
A Hybrid Linear Programming and Evolutionary Algorithm based Approach for On-line Resource Matching in Grid Environments
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
Pawel Garbacki, Vijay K. Naik
SEBD
2007
164views Database» more  SEBD 2007»
15 years 1 months ago
Online Distribution Estimation for Streaming Data: Framework and Applications
In the last few years, we have been witnessing an evergrowing need for continuous observation and monitoring applications. This need is driven by recent technological advances that...
Themis Palpanas, Vana Kalogeraki, Dimitrios Gunopu...