6365 search results - page 241 / 1273 » Fast Local Computation Algorithms |
317
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
158
click to vote
ATAL
2004
Springer
15 years 12 months ago
2004
Springer
Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to joi...
168
click to vote
ARITH
2005
IEEE
16 years 4 days ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
164
click to vote
DAC
1998
ACM
15 years 10 months ago
1998
ACM
This papers describes a new, fast and economical methodology to test linear analog circuits based on adaptive algorithms. To the authors knowledge, this is the first time such tec...
162
click to vote
PDP
2005
IEEE
16 years 2 days ago
2005
IEEE
Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several seq...