Sciweavers

1101 search results - page 69 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
JMLR
2012
13 years 5 days ago
Generic Methods for Optimization-Based Modeling
“Energy” models for continuous domains can be applied to many problems, but often suffer from high computational expense in training, due to the need to repeatedly minimize t...
Justin Domke
ICPR
2004
IEEE
15 years 10 months ago
Registration of an Uncalibrated Image Pair to a 3D Surface Model
The following data fusion problem is considered: Given a 3D geometric model of an object and two uncalibrated images of the same object, and assuming that the object surface is te...
Dmitry Chetverikov, Zsolt Jankó
CP
2005
Springer
15 years 3 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
14 years 9 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
JCST
2010
139views more  JCST 2010»
14 years 8 months ago
Dirichlet Process Gaussian Mixture Models: Choice of the Base Distribution
In the Bayesian mixture modeling framework it is possible to infer the necessary number of components to model the data and therefore it is unnecessary to explicitly restrict the n...
Dilan Görür, Carl Edward Rasmussen