Sciweavers

601 search results - page 66 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
ICASSP
2008
IEEE
15 years 8 months ago
Learning to satisfy
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
Frederic Thouin, Mark Coates, Brian Eriksson, Robe...
NIPS
2003
15 years 2 months ago
Ambiguous Model Learning Made Unambiguous with 1/f Priors
What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the a...
Gurinder S. Atwal, William Bialek
TSC
2010
159views more  TSC 2010»
14 years 8 months ago
A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple v...
Benjamin Speitkamp, Martin Bichler
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
15 years 2 months ago
An evolutionary approach for competency-based curriculum sequencing
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...
Luis de Marcos, José-Javier Martínez...
CONCUR
2004
Springer
15 years 7 months ago
Model Checking Timed Automata with One or Two Clocks
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
François Laroussinie, Nicolas Markey, Ph. S...