2069 search results - page 86 / 414 » Linear time algorithms for Clobber |
128
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
159
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
Field programmable dual-Vdd interconnects are effective to reduce FPGA power. Assuming uniform length interconnects, existing work has developed time slack budgeting to minimize p...
167
click to vote
SPAA
1999
ACM
15 years 8 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
140
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
146
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...