Sciweavers

361 search results - page 9 / 73
» Trade of a problem-solving task
Sort
View
RTSS
2005
IEEE
14 years 1 months ago
Trading End-to-End Latency for Composability
The periodic resource model for hierarchical, compositional scheduling abstracts task groups by resource requirements. We study this model in the presence of dataflow constraints...
Slobodan Matic, Thomas A. Henzinger
BIRTHDAY
2004
Springer
14 years 1 months ago
Engineers Don't Search
Abstract. This paper is on the automation of knowledge-intensive tasks in engineering domains; here, the term “task” relates to analysis and synthesis tasks, such as diagnosis ...
Benno Stein
AIPS
2004
13 years 9 months ago
Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
ICML
2008
IEEE
14 years 8 months ago
Structure compilation: trading structure for features
Structured models often achieve excellent performance but can be slow at test time. We investigate structure compilation, where we replace structure with features, which are often...
Dan Klein, Hal Daumé III, Percy Liang
AIED
2009
Springer
14 years 2 months ago
To Tutor or Not to Tutor: That is the Question
Intelligent tutoring systems often rely on interactive tutored problem solving to help students learn math, which requires students to work through problems step-by-step while the ...
Leena M. Razzaq, Neil T. Heffernan