1982 search results - page 118 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
166
click to vote
AAAI
1994
15 years 5 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
166
click to vote
GLVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
One of the fundamental problems in Deep Sub Micron (DSM) circuits is Simultaneous Switching Noise (SSN), which causes voltage fluctuations in the circuit power/ground networks. In...
112
click to vote
ADC
2007
Springer
15 years 8 months ago
2007
Springer
Derived horizontal fragmentation is one of the main database distribution design techniques. Unlike primary horizontal fragmentation, the decision of derived horizontal fragmentat...
150
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
Topics in prior-art patent search are typically full patent applications and relevant items are patents often taken from sources in different languages. Cross language patent retr...
147
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...