Sciweavers

984 search results - page 30 / 197
» ideas 2010
Sort
View
95
Voted
COR
2010
152views more  COR 2010»
15 years 26 days ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
118
Voted
ENDM
2010
110views more  ENDM 2010»
15 years 25 days ago
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
Ivana Ljubic, Stefan Gollowitzer
ENTCS
2006
121views more  ENTCS 2006»
15 years 23 days ago
A Logic for Graphs with QoS
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...
GianLuigi Ferrari, Alberto Lluch-Lafuente
ENTCS
2006
107views more  ENTCS 2006»
15 years 23 days ago
Exact and Portable Profiling for the JVM Using Bytecode Instruction Counting
This paper presents a novel profiling approach, which is entirely based on program transformation techniques in order to enable exact profiling, preserving complete call stacks, m...
Walter Binder, Jarle Hulaas
122
Voted
ENTCS
2007
120views more  ENTCS 2007»
15 years 21 days ago
A Framework for Interpreting Traces of Functional Logic Computations
This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic progr...
Bernd Braßel