Sciweavers

2738 search results - page 169 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
CF
2010
ACM
15 years 9 months ago
EXACT: explicit dynamic-branch prediction with active updates
Branches that depend directly or indirectly on load instructions are a leading cause of mispredictions by state-of-the-art branch predictors. For a branch of this type, there is a...
Muawya Al-Otoom, Elliott Forbes, Eric Rotenberg
ECAI
2008
Springer
15 years 6 months ago
Heuristics for Planning with Action Costs Revisited
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
Emil Keyder, Hector Geffner
161
Voted
ITS
2000
Springer
159views Multimedia» more  ITS 2000»
15 years 8 months ago
Can We Learn from ITSs?
With the rise of VR, the internet, and mobile technologies and the shifts in educational focus from teaching to learning and from solitary to collaborative work, it's easy (bu...
Benedict du Boulay
218
Voted
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 4 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
143
Voted
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 4 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin