2543 search results - page 344 / 509 » Optimal Ordered Problem Solver |
125
click to vote
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
117
Voted
ASPDAC
2007
ACM
15 years 6 months ago
2007
ACM
Power supply noise increases the circuit delay, which may lead to performance failure of a design. Decoupling capacitance (decap) addition is effective in reducing the power suppl...
142
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
137
click to vote
NIPS
2008
15 years 3 months ago
2008
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...
150
click to vote
COMGEO
2008
ACM
15 years 2 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...