Sciweavers

18090 search results - page 314 / 3618
» Computing by Only Observing
Sort
View
COMGEO
2000
ACM
15 years 6 months ago
Computing simple paths among obstacles
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
FCSC
2010
108views more  FCSC 2010»
15 years 5 months ago
On the computation of quotients and factors of regular languages
Quotients and factors are important notions in the design of various computational procedures for regular languages and for the analysis of their logical properties. We propose a n...
Mircea Marin, Temur Kutsia
SIGOPS
2010
124views more  SIGOPS 2010»
15 years 5 months ago
Decoupling storage and computation in Hadoop with SuperDataNodes
The rise of ad-hoc data-intensive computing has led to the development of data-parallel programming systems such as Map/Reduce and Hadoop, which achieve scalability by tightly cou...
George Porter
TCS
2010
15 years 5 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre

Publication
1286views
17 years 4 months ago
A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems
Fairness is an important performance criterion in all resource allocation schemes, including those in distributed computer systems. However, it is often specified only qualitativel...
R. Jain, D. Chiu, and W. Hawe