Sciweavers

893 search results - page 32 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
MP
2002
86views more  MP 2002»
13 years 7 months ago
Multistars, partial multistars and the capacitated vehicle routing problem
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...
TWC
2010
13 years 2 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim
ISBI
2006
IEEE
14 years 1 months ago
x-f SENSE: optimal spatio-temporal sensitivity encoding for dynamic MR imaging
For high quality MR imaging of time-varying objects such as beating heart or brain hemodynamics, we need to reduce signal acquisition time without sacrificing the spatial resolut...
Jinhee Kim, Jong Chul Ye, Jaehung Yoo
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
14 years 1 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
KDD
2005
ACM
151views Data Mining» more  KDD 2005»
14 years 8 months ago
Discovering evolutionary theme patterns from text: an exploration of temporal text mining
Temporal Text Mining (TTM) is concerned with discovering temporal patterns in text information collected over time. Since most text information bears some time stamps, TTM has man...
Qiaozhu Mei, ChengXiang Zhai