Sciweavers

1171 search results - page 210 / 235
» Variable neighborhood search
Sort
View
AIR
2004
130views more  AIR 2004»
13 years 7 months 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...
AAMAS
2000
Springer
13 years 7 months ago
Algorithms for Distributed Constraint Satisfaction: A Review
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
Makoto Yokoo, Katsutoshi Hirayama
ENTCS
2002
97views more  ENTCS 2002»
13 years 7 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott
IDA
2002
Springer
13 years 7 months ago
A framework for modelling virus gene expression data
Short, high-dimensional, Multivariate Time Series (MTS) data are common in many fields such as medicine, finance and science, and any advance in modelling this kind of data would b...
Paul Kellam, Xiaohui Liu, Nigel J. Martin, Christi...
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
13 years 7 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...