1092 search results - page 65 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
201
click to vote
COMAD
2009
15 years 7 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
163
click to vote
TC
2008
15 years 5 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
202
click to vote
WADS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
158
Voted
ISAAC
2009
Springer
16 years 13 days ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
145
click to vote
GLOBECOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...