Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

60

Voted

ENTCS
2007

86views more ENTCS 2007»

Programmed Search in a Timetabling Problem over Finite Domains

15 years 2 months ago

Programmed Search in a Timetabling Problem over Finite Domains

Download www.fdi.ucm.es

R. González-del-Campo, Fernando Sáen

Real-time Traffic

ENTCS 2007 |

claim paper

Related Content

» Semantic Components for Timetabling

» Complexity of Rule Redundancy in Nonground AnswerSet Programming over Finite Domains

» Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search

» An Attempt to Dynamically Break Symmetries in the Social Golfers Problem

» From Rules to Constraint Programs with the Rules2CP Modelling Language

» FiniteTree Analysis for Constraint LogicBased Languages

» Combinatorial sketching for finite programs

» FiniteTree Analysis for Constraint LogicBased Languages The Complete Unabridged Version

» A Local SearchConstraint Propagation Hybrid for a Network Routing Problem

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENTCS
Authors	R. González-del-Campo, Fernando Sáenz-Pérez

Comments (0)