Sciweavers

598 search results - page 25 / 120
» A Deterministic Metaheuristic Approach Using
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 2 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
SAC
2003
ACM
14 years 29 days ago
Manpower Scheduling with Time Windows
In this paper, we propose a manpower allocation model with time windows which is of practical interest to serviceman scheduling operations. Specifically, this problem originates f...
Andrew Lim, Brian Rodrigues, Lei Song
JAIR
2000
96views more  JAIR 2000»
13 years 7 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
EVOW
2004
Springer
14 years 1 months ago
A Scenario-Based Approach to Protocol Design Using Evolutionary Techniques
An evolutionary approach to design communication protocols from scenario-based specifications is presented. It enables to automatically generate finite-state models of protocol ent...
Sérgio G. Araújo, Antônio C. M...