Sciweavers

26354 search results - page 5137 / 5271
» How we refactor, and how we know it
Sort
View
COR
2007
163views more  COR 2007»
15 years 1 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
CORR
2007
Springer
123views Education» more  CORR 2007»
15 years 1 months ago
Channel Capacity Estimation using Free Probability Theory
—In many channel measurement applications, one needs to estimate some characteristics of the channels based on a limited set of measurements. This is mainly due to the highly tim...
Øyvind Ryan, Mérouane Debbah
CPC
2007
105views more  CPC 2007»
15 years 1 months ago
Packing Cliques in Graphs with Independence Number 2
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
Raphael Yuster
95
Voted
JAR
2006
71views more  JAR 2006»
15 years 1 months ago
Mathematical Induction in Otter-Lambda
Otter-lambda is Otter modified by adding code to implement an algorithm for lambda unification. Otter is a resolution-based, clause-language first-order prover that accumulates de...
Michael Beeson
CSI
2007
89views more  CSI 2007»
15 years 1 months ago
Writing and executing ODP computational viewpoint specifications using Maude
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
José Raúl Romero, Antonio Vallecillo...
« Prev « First page 5137 / 5271 Last » Next »