86 search results - page 10 / 18 » Worst-Case Running Times for Average-Case Algorithms |
108
click to vote
GECON
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
119
click to vote
JPDC
2006
14 years 9 months ago
2006
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
ACL
1998
14 years 11 months ago
1998
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
WCET
2010
14 years 7 months ago
2010
To take full advantage of the increasingly used shared-memory multicore architectures, software algorithms will need to be parallelized over multiple threads. This means that thre...