Sciweavers

9842 search results - page 1717 / 1969
» Problem complexity
Sort
View
TELSYS
2002
73views more  TELSYS 2002»
15 years 6 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
TMI
2002
107views more  TMI 2002»
15 years 6 months ago
Volumetric Segmentation of Brain Images Using Parallel Genetic Algorithms
Active model-based segmentation has frequently been used in medical image processing with considerable success. Although the active model-based method was initially viewed as an op...
Yong Fan, Tianzi Jiang, David J. Evans
VLDB
2002
ACM
156views Database» more  VLDB 2002»
15 years 6 months ago
A Logical Framework for Scheduling Workflows under Resource Allocation Constraints
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Pinar Senkul, Michael Kifer, Ismail Hakki Toroslu
WINET
2002
138views more  WINET 2002»
15 years 6 months ago
An Architecture for Secure Wide-Area Service Discovery
Abstract. The widespread deployment of inexpensive communications technology, computational resources in the networking infrastructure, and network-enabled end devices poses an int...
Todd D. Hodes, Steven E. Czerwinski, Ben Y. Zhao, ...
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 6 months ago
On Optimal Deadlock Detection Scheduling
Deadlock detection scheduling is an important, yet often overlooked problem that can significantly affect the overall performance of deadlock handling. Excessive initiation of dea...
Yibei Ling, Shigang Chen, Cho-Yu Jason Chiang
« Prev « First page 1717 / 1969 Last » Next »