48 search results - page 9 / 10 » Fast local searches and updates in bounded universes |
PODC
2011
ACM
12 years 8 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
NGITS
1993
Springer
13 years 9 months ago
1993
Springer
AMOS (Active Mediators Object System) is an architecture to model, locate, search, combine, update, and monitor data in information systems with many work stations connected using...
MP
2011
12 years 8 months ago
2011
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
WINE
2009
Springer
13 years 11 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
TVCG
2012
11 years 7 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...