Sciweavers

914 search results - page 107 / 183
» Analysis of Heuristic Synergies
Sort
View
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 3 months ago
Structure and metaheuristics
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
Yossi Borenstein, Riccardo Poli
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
15 years 3 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
WSC
2008
15 years 2 months ago
A simulation based scheduling model for call centers with uncertain arrival rates
In this paper we develop a two stage algorithm for scheduling call centers with strict SLAs and arrival rate uncertainty. The first cut schedule can be developed in less than a mi...
Thomas R. Robbins, Terry P. Harrison
CONEXT
2008
ACM
15 years 1 months ago
EGOIST: overlay routing using selfish neighbor selection
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals ...
Georgios Smaragdakis, Vassilis Lekakis, Nikolaos L...
FMCAD
2008
Springer
15 years 1 months ago
Invariant-Strengthened Elimination of Dependent State Elements
Abstract-- This work presents a technology-independent synthesis optimization that is effective in reducing the total number of state elements of a design. It works by identifying ...
Michael L. Case, Alan Mishchenko, Robert K. Brayto...