Sciweavers

273 search results - page 19 / 55
» Problem formulation as the reduction of a decision model
Sort
View
ICMLA
2008
13 years 10 months ago
Prediction-Directed Compression of POMDPs
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
ICDAR
2007
IEEE
14 years 16 days ago
On Computing Strength of Evidence for Writer Verification
The problem of Writer Verification is to make a decision of whether or not two handwritten documents are written by the same person. Providing a strength of evidence for any such ...
Harish Srinivasan, S. Kabra, Chen Huang, Sargur N....
SARA
2007
Springer
14 years 2 months ago
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
Ian P. Gent, Ian Miguel, Andrea Rendl
WSC
2001
13 years 10 months ago
Using simulation and neural networks to develop a scheduling advisor
The research using artificial intelligence and computer simulation introduces a new approach for solving the job shop-scheduling problem. The new approach is based on the developm...
Thanos Alifantis, Stewart Robinson
DATESO
2008
129views Database» more  DATESO 2008»
13 years 10 months ago
Database Engineering from the Category Theory Viewpoint
Abstract. This paper gives an overview of XML formal models, summarizes database engineering practices, problems and their evolution. We focus on categorical aspects of XML formal ...
David Toth