Sciweavers

1095 search results - page 152 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
RTSS
2008
IEEE
15 years 4 months ago
Merge-by-Wire: Algorithms and System Support
Automakers are trying to make vehicles more intelligent and safe by embedding processors which can be used to implement by-wire applications for taking smart decisions on the road...
Vipul Shingde, Gurulingesh Raravi, Ashish Gudhe, P...
JASIS
2007
122views more  JASIS 2007»
14 years 9 months ago
Exploiting parallelism to support scalable hierarchical clustering
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
Rebecca Cathey, Eric C. Jensen, Steven M. Beitzel,...
IS
2007
14 years 9 months ago
Improving process models by discovering decision points
Workflow management systems (WfMS) are widely used by business enterprises as tools for administrating, automating and scheduling the business process activities with the availab...
Sharmila Subramaniam, Vana Kalogeraki, Dimitrios G...
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
15 years 4 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
ANCS
2005
ACM
15 years 3 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley