Sciweavers

4894 search results - page 759 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
JBI
2006
102views Bioinformatics» more  JBI 2006»
13 years 8 months ago
Heuristic evaluation of paper-based Web pages: A simplified inspection usability methodology
Online medical information, when presented to clinicians, must be well-organized and intuitive to use, so that the clinicians can conduct their daily work efficiently and without ...
Mureen Allen, Leanne M. Currie, Suzanne Bakken, Vi...
JCO
2006
234views more  JCO 2006»
13 years 8 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
JCO
2006
126views more  JCO 2006»
13 years 8 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
JCO
2006
150views more  JCO 2006»
13 years 8 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson
JEA
2006
83views more  JEA 2006»
13 years 8 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna