Sciweavers

858 search results - page 90 / 172
» One Is Enough!
Sort
View
ECOOPW
1998
Springer
14 years 1 months ago
Run-Time Adaptability of Synchronization Policies in Concurrent Object Oriented Languages
Adaptability has become one of the most important research areas in concurrent object-oriented systems in recent years. It tries to cope with system evolution by adding/replacing ...
Fernando Sánchez, Juan Hernández N&u...
ICDCS
1997
IEEE
14 years 1 months ago
Effect of Connection Rerouting on Application Performance in Mobile Networks
—The increasing deployment of wireless access technology, along with the emergence of high speed integrated service networks, such as ATM, promises to provide mobile users with u...
Partho Pratim Mishra, Mani B. Srivastava
ICCAD
1994
IEEE
109views Hardware» more  ICCAD 1994»
14 years 1 months ago
Efficient breadth-first manipulation of binary decision diagrams
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...
Pranav Ashar, Matthew Cheong
PDIS
1993
IEEE
14 years 1 months ago
Nested Loops Revisited
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burge...
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
14 years 1 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...