Sciweavers

1162 search results - page 232 / 233
» Specifying Reusable Components
Sort
View
INFOCOM
2010
IEEE
13 years 4 months ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...
INFOCOM
2010
IEEE
13 years 3 months ago
MeasuRouting: A Framework for Routing Assisted Traffic Monitoring
Monitoring transit traffic at one or more points in a network is of interest to network operators for reasons of traffic accounting, debugging or troubleshooting, forensics, and tr...
Saqib Raza, Guanyao Huang, Chen-Nee Chuah, Srini S...
ICSR
2009
Springer
13 years 3 months ago
Reusing Patterns through Design Refinement
Abstract. Refinement concepts, such as procedural and data refinement, are among the most important ideas of software engineering. In this paper, we investigate the idea of design ...
Jason O. Hallstrom, Neelam Soundarajan
IEEEPACT
2009
IEEE
13 years 3 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...
TVCG
2011
136views more  TVCG 2011»
13 years 24 days ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai