Sciweavers

127 search results - page 25 / 26
» Contour Grouping and Abstraction using Simple Part Models
Sort
View
SOICT
2010
13 years 15 days ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
ICDCS
1991
IEEE
13 years 9 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
INFOCOM
2008
IEEE
14 years 5 days ago
Index Policies for Real-Time Multicast Scheduling for Wireless Broadcast Systems
Abstract—Motivated by the increasing usage of wireless broadcast networks for multicast real-time applications like video, this paper considers a canonical real-time multicast sc...
Vivek Raghunathan, Vivek S. Borkar, Min Cao, P. R....
RTAS
2006
IEEE
13 years 11 months ago
Zygaria: Storage Performance as a Managed Resource
Large-scale storage systems often hold data for multiple applications and users. A problem in such systems is isolating applications and users from each other to prevent their wor...
Theodore M. Wong, Richard A. Golding, Caixue Lin, ...
OOPSLA
2005
Springer
13 years 11 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking