Sciweavers

518 search results - page 67 / 104
» Advanced Question and Answering Systems for Community Develo...
Sort
View
HIPC
2007
Springer
15 years 1 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
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
14 years 9 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
ITS
2010
Springer
178views Multimedia» more  ITS 2010»
15 years 2 months ago
Learning What Works in ITS from Non-traditional Randomized Controlled Trial Data
The traditional, well established approach to finding out what works in education research is to run a randomized controlled trial (RCT) using a standard pretest and posttest desig...
Zachary A. Pardos, Matthew D. Dailey, Neil T. Heff...
LICS
1996
IEEE
15 years 1 months ago
The Theory of Hybrid Automata
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
Thomas A. Henzinger
ACSAC
2001
IEEE
15 years 1 months ago
Requirements for a General Framework for Response to Distributed Denial-of-Service
What is network denial of service (DoS), and why is it such a problem? This research project has sought to investigate these questions and look at the deeper questions such as can...
D. W. Gresty, Qi Shi, Madjid Merabti