Sciweavers

920 search results - page 28 / 184
» Generating Satisfiable Problem Instances
Sort
View
PATAT
2004
Springer
151views Education» more  PATAT 2004»
14 years 3 months ago
Decomposition and Parallelization of Multi-resource Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
Petr Slechta
SAT
2004
Springer
117views Hardware» more  SAT 2004»
14 years 3 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher
EOR
2008
140views more  EOR 2008»
13 years 10 months ago
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
Christine Solnon
JALC
2002
97views more  JALC 2002»
13 years 10 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
ENDM
2010
126views more  ENDM 2010»
13 years 10 months ago
A 0/1 Integer Programming Model for the Office Space Allocation Problem
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
Özgür Ülker, Dario Landa-Silva