402 search results - page 40 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
NIPS
2007
13 years 9 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
IM
2007
13 years 7 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
IPPS
2003
IEEE
14 years 28 days ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
Location awareness is an attractive research issue in the wireless sensor network (WSN). However, precise location information may be unavailable due to the constraint in energy, ...
AI
1998
Springer
13 years 7 months ago
1998
Springer
Task execution in multi-agent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where ...