2485 search results - page 83 / 497 » Time Bounded Frequency Computations |
126
Voted
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
123
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
We present a new control design method for perturbed multiple-input systems, which guarantees any desired componentwise ultimate bound on the system state. The method involves eig...
143
click to vote
NETWORKS
2008
15 years 4 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
124
click to vote
RTCSA
2007
IEEE
15 years 10 months ago
2007
IEEE
Multicore platforms, which include several processing cores on a single chip, are being widely touted as a solution to heat and energy problems that are impediments to single-core...
145
click to vote
IPL
2002
15 years 4 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...