Sciweavers

2917 search results - page 373 / 584
» Satisfying Interaction Constraints
Sort
View
AAAI
1997
15 years 8 months ago
The Scaling of Search Cost
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby...
AAAI
1992
15 years 7 months ago
Causal Approximations
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
P. Pandurang Nayak
ICML
2010
IEEE
15 years 7 months ago
High-Performance Semi-Supervised Learning using Discriminatively Constrained Generative Models
We develop a semi-supervised learning method that constrains the posterior distribution of latent variables under a generative model to satisfy a rich set of feature expectation c...
Gregory Druck, Andrew McCallum
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 6 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
15 years 6 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...