Sciweavers

470 search results - page 80 / 94
» Tabu Search for SAT
Sort
View
AIR
2004
130views more  AIR 2004»
15 years 16 days ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
TEC
2002
152views more  TEC 2002»
15 years 8 days ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck
102
Voted
NETWORKS
2010
14 years 11 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
TVCG
2008
118views more  TVCG 2008»
15 years 16 days ago
Visual Perception and Mixed-Initiative Interaction for Assisted Visualization Design
This paper describes the integration of perceptual guidelines from human vision with an AI-based mixed-initiative search strategy. The result is a visualization assistant called Vi...
Christopher G. Healey, Sarat Kocherlakota, Vivek R...
92
Voted
AI
2005
Springer
15 years 17 days ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo