2252 search results - page 57 / 451 » Lower Bounds for Dynamic Algorithms |
108
click to vote
AIPS
2008
15 years 3 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
103
click to vote
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
110
click to vote
SIROCCO
2008
15 years 2 months ago
2008
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. ...
TPDS
1998
15 years 1 months ago
1998
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
ENDM
2010
15 years 1 months ago
2010
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...