Sciweavers

4860 search results - page 197 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
DISOPT
2011
240views Education» more  DISOPT 2011»
13 years 5 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
CODES
2005
IEEE
14 years 4 months ago
Key research problems in NoC design: a holistic perspective
Networks-on-Chip (NoCs) have been recently proposed as a promising solution to complex on-chip communication problems. The lack of an unified representation of applications and ar...
Ümit Y. Ogras, Jingcao Hu, Radu Marculescu
EOR
2002
74views more  EOR 2002»
13 years 10 months ago
Modeling multistage cutting stock problems
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
Eugene J. Zak
WSC
2008
14 years 21 days ago
Simulation-based optimization for the quay crane scheduling problem
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...
Pasquale Legato, Rina Mary Mazza, Roberto Trunfio
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...