Sciweavers

94 search results - page 2 / 19
» Turning Cycles into Spirals
Sort
View
JUCS
2008
127views more  JUCS 2008»
13 years 5 months ago
A Spiral Model for Adding Automatic, Adaptive Authoring to Adaptive Hypermedia
: At present a large amount of research exists into the design and implementation of adaptive systems. However, not many target the complex task of authoring in such systems, or th...
Maurice Hendrix, Alexandra I. Cristea
INFOCOM
2002
IEEE
13 years 10 months ago
Application of Network Calculus to General Topologies using Turn-Prohibition
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
David Starobinski, Mark G. Karpovsky, Lev Zakrevsk...
HICSS
2009
IEEE
135views Biometrics» more  HICSS 2009»
14 years 7 days ago
Building Leadership for Life Cycle Business Transition by Hybrid Innovation
Manufacturing companies that are expanding their product offering to cover also lifecycle services in the customers’ facilities are facing the increasing complexity and risk to ...
Vesa Salminen
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 7 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
IPPS
2009
IEEE
14 years 2 days ago
Deadlock prevention by turn prohibition in interconnection networks
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa