Sciweavers

10493 search results - page 145 / 2099
» Dynamic Word Problems
Sort
View
IJCAI
1989
13 years 9 months ago
A Planning/Scheduling Methodology for the Constrained Resource Problem
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
Naiping Keng, David Y. Y. Yun
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 2 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
CPAIOR
2006
Springer
13 years 11 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
ACL
2008
13 years 9 months ago
Arabic Language Modeling with Finite State Transducers
In morphologically rich languages such as Arabic, the abundance of word forms resulting from increased morpheme combinations is significantly greater than for languages with fewer...
Ilana Heintz
AH
2004
Springer
14 years 1 months ago
Evaluating Adaptive Problem Selection
: This paper presents an evaluation study that compares two different problem selection strategies for an Intelligent Tutoring System (ITS). The first strategy uses static problem ...
Antonija Mitrovic, Brent Martin