Sciweavers

95 search results - page 4 / 19
» Finding one tight cycle
Sort
View
SCHEDULING
2008
152views more  SCHEDULING 2008»
14 years 9 months ago
Bicriteria robotic cell scheduling
This paper considers the scheduling problems arising in two- and three-machine manufacturing cells configured in a flowshop which repeatedly produces one type of product and where ...
Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan
BMCBI
2010
92views more  BMCBI 2010»
14 years 10 months ago
Integrating gene expression and GO classification for PCA by preclustering
Background: Gene expression data can be analyzed by summarizing groups of individual gene expression profiles based on GO annotation information. The mean expression profile per g...
Jorn R. de Haan, Ester Piek, René C. van Sc...
CORR
2004
Springer
124views Education» more  CORR 2004»
14 years 10 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini

Publication
397views
15 years 12 months ago
Build it but where? A GIS methodology for guiding the planning of new cycling facilities
Concern over climate change, traffic congestion, and the health consequences of sedentary lifestyles has resulted in a surge of interest in cycling as an efficient form of urban ...
Larsen, J. & El-Geneidy, M.
MFCS
2007
Springer
15 years 4 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda