2925 search results - page 30 / 585 » Information Complexity of Online Problems |
150
click to vote
CPM
2005
Springer
15 years 11 months ago
2005
Springer
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...
162
click to vote
AIPS
2009
15 years 6 months ago
2009
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...
138
click to vote
SSS
2009
Springer
15 years 10 months ago
2009
Springer
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
168
click to vote
CCGRID
2007
IEEE
15 years 9 months ago
2007
IEEE
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...
148
click to vote
ISSA
2008
15 years 7 months ago
2008
The problem today is that users are expected to remember multiple user names and passwords for different domains when accessing the Internet. Identity management solutions seek to...