3946 search results - page 122 / 790 » The computational complexity of choice sets |
177
click to vote
RTCSA
2006
IEEE
16 years 15 days ago
2006
IEEE
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
182
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
217
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
204
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
193
click to vote
HPCA
2012
IEEE
14 years 2 months ago
2012
IEEE
Large-scale CMPs with hundreds of cores require a directory-based protocol to maintain cache coherence. However, previously proposed coherence directories are hard to scale beyond...