Sciweavers

1243 search results - page 102 / 249
» EDZL Scheduling Analysis
Sort
View
HIPC
2007
Springer
15 years 7 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ANLP
1992
92views more  ANLP 1992»
15 years 5 months ago
Robust Processing of Real-World Natural-Language Texts
It is often assumed that when natural language processing meets the real world, the ideal of aiming for complete and correct interpretations has to be abandoned. However, our expe...
Jerry R. Hobbs, Douglas E. Appelt, John Bear, Mabr...
JSS
2002
90views more  JSS 2002»
15 years 3 months ago
Producing reliable software: an experiment
A customer of high assurance software recently sponsored a software engineering experiment in which a small real-time software system was developed concurrently by two popular sof...
Carol Smidts, Xin Huang, James C. Widmaier
132
Voted
CORR
2008
Springer
78views Education» more  CORR 2008»
15 years 3 months ago
Wireless Secrecy in Cellular Systems with Infrastructure--Aided Cooperation
In cellular systems, confidentiality of uplink transmission with respect to eavesdropping terminals can be ensured by creating intentional interference via scheduling of concurren...
Petar Popovski, Osvaldo Simeone
ECRTS
2007
IEEE
15 years 10 months ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher