Sciweavers

2254 search results - page 142 / 451
» Computing the minimal covering set
Sort
View
BROADNETS
2007
IEEE
15 years 7 months ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
Dragan Milic, Torsten Braun
125
Voted
KI
2007
Springer
15 years 7 months ago
Pinpointing in the Description Logic EL+
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
Franz Baader, Rafael Peñaloza, Boontawee Su...
EVOW
2005
Springer
15 years 6 months ago
Evolutionary Biclustering of Microarray Data
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
Jesús S. Aguilar-Ruiz, Federico Divina
114
Voted
EOR
2007
90views more  EOR 2007»
15 years 29 days ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
122
Voted
IJHIS
2007
89views more  IJHIS 2007»
15 years 28 days ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena